Found 101 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is B  [Clear All Filters]
Kadanoff, L. P., & Shenker S. (1981).  Band to Band Hopping in One-Dimensional Maps. Journal of Physics A: Mathematical and General. 14(2), L23-26.
Jurafsky, D., Wooters C., Tajchman G., Segal J., Stolcke A., Fosler-Lussier E., et al. (1994).  The Berkeley Restaurant Project. Proceedings of the Third International Conference on Spoken Language Processing (ICSLP 94). 2139-2142.
Stolcke, A., & Omohundro S. (1994).  Best-First Model Merging for Hidden Markov Model Induction.
Morgan, N. (1994).  Big Dumb Neural Nets: A Working Brute Force Approach to Speech Recognition. Proceedings of the International Conference on Neural Networks. VII, 4462-4465.
Schnorr, C. P., & Vaudenay S. (1994).  Black Box Cryptanalysis of Hash Networks Based on Multipermutations.
Karp, R. M., Waarts O., & Zweig G. (1995).  The bit vector intersection problem. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 621-630.
Karp, R. M., & Zhang Y. (1995).  Bounded branching process and AND/OR tree evaluation. Random Structures and Algorithms. 7(2), 97-116.
Tajchman, G., Fosler-Lussier E., & Jurafsky D. (1995).  Building Multiple Pronunication Models for Novel Words using Exploratory Computational Phonology. Proceedings of the Fourth European Conference on Speech Communication and Technology (Eurospeech '95).
Baker, C. F., Fillmore C. J., & Lowe J.. B. (1998).  The Berkeley FrameNet Project. Proceedings of the Joint Conference of the International Committee on Computational Linguistics and the Association for Computational Linguistics (COLING-ACL).
Breslau, L., & Shenker S. (1998).  Best-Effort versus Reservations: A Simple Comparative Analysis. ACM Computer Communication Review. 28, 3-16.
Bockmayr, A.., & Kasper T.. (1998).  Branch and Infer: A Unifying Framework for Integer and Nite Domain Constraint Programming.