Publications

Found 106 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is B  [Clear All Filters]
1975
Feldman, J. (1975).  Bad-Mouthing Frames.
1981
Kadanoff, L. P., & Shenker S. J. (1981).  Band to Band Hopping in One-Dimensional Maps. Journal of Physics A: Mathematical and General. 14(2), L23-26.
1984
Feldman, J. (1984).  Brains and Robots, Two Weak Attempts at the Grand Synthesis.
1989
Haban, D., & Wybranietz D. (1989).  Behavior and Performance Analysis of Distributed Systems Using a Hybrid.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
1990
Ferrari, D., & Verma D. C. (1990).  Buffer Space Allocation for Real-Time Channels in a Packet-Switching Network.
1991
Blum, L. (1991).  A Brief History of the Association for Women in Mathematics: The Presidents' Perspectives.
Omohundro, S. (1991).  Bumptrees for Efficient Function, Constraint, and Classification Learning.
1992
Seidel, R.. (1992).  Backwards Analysis of Randomized Geometric Algorithms.
Omohundro, S. (1992).  Best-First Model Merging for Dynamic Learning and Recognition.
Schnorr, C. P. (1992).  Block Korkin-Zolotarev Bases and Successive Minima.
Schuett, D.., Eckhardt U.., & Suda P.. (1992).  Boot Algebras.
1993
Wooters, C., Jurafsky D., Tajchman G., & Morgan N. (1993).  The Berkeley Restaurant Project. Proceedings of the Speech Research Symposium XIII. 119-128.
Pellegrini, M. (1993).  Building Convex Space Partitions Induced by Pairwise Interior-Disjoint Simplices.
1994
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.
1995
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).
1996
Feldman, J. (1996).  Book Review, Crangle and Suppes, “Language Learning".
1998
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. J. (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.

Pages