Publications

Found 4258 results
Author Title Type [ Year(Asc)]
1992
Darken, C., & Moody J. (1992).  Towards Faster Stochastic Gradient Search. 4,
Hermansky, H., & Morgan N. (1992).  Towards Handling the Acoustic Environment in Spoken Language Processing. Proceedings of the International Conference on Spoken Language Processing (ICSLP'92). 85-88.
Floyd, S., & Jacobson V. (1992).  On Traffic Phase Effects in Packet-Switched Gateways. Internetworking: Research and Experience. 3(3), 115-156.
Stolcke, A., & Wu D. (1992).  Tree Matching with Recursive Distributed Representations.
d'Amore, F., Marchetti-Spaccamela A., & Nanni U. (1992).  The Weighted List Update Problem and the Lazy Adversary.
Frieze, A., Karp R. M., & Reed B. (1992).  When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?.
1991
Renals, S., Morgan N., Bourlard H., Cohen M., Franco H., Wooters C., et al. (1991).  Advances in Connectionist Speech Recognition.
[Anonymous] (1991).  Advances in Neural Information Processing Systems 3. (Lippmann, R.., Moody J., & Touretzky D.., Ed.).
Grigoriev, D. Yu., & Karpinski M. (1991).  Algorithms for Sparse Rational Interpolation.
Grigoriev, D. Yu., & Karpinski M. (1991).  An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q].
Zimmermann, W. (1991).  The Automatic Worst Case Analysis of Parallel Programs: Single Parallel Sorting and Algorithms on Graphs.
Pucci, G., & Zimmermann W. (1991).  On the Average Case Complexity of Parallel Sublist Selection.
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.
Feldman, J., Hayhoe M.., & Lachter J.. (1991).  Capacity Limitations in the Integration of Information Across Saccades.
Hermansky, H., Morgan N., Bayya A., & Kohn P. (1991).  The Challenge of Inverse-E: The RASTA-PLP Method. Proceedings of the 25th Asilomar Conference on Signals, Systems, & Computers. 800-804.
Ausiello, G., Protasi M., & Angelaccio M. (1991).  A Characterization of Space Complexity Cases and Subexponential Time Classesas Limiting Polynomially Decidable Sets.
Hölldobler, S., & Kurfess F. (1991).  CHCL--A Connectionist Inference System.
Schmidt, H. W., & Omohundro S. (1991).  CLOS, Eiffel, and Sather: A Comparison.
Feldman, J. (1991).  Cognition as Search: review of Unified Theories of Cognition, (by Allen Newell, Harvard University Press, Cambridge, MA, 1990). Science. 251(2), 575.
Aberer, K. (1991).  Combinatory Differential Fields: An Algebraic Approach to Approximate Computation and Constructive Analysis.
Hermansky, H., Bayya A., Morgan N., & Kohn P. (1991).  Compensation for the effect of the communication channel in Perceptual Linear Predictive (PLP) analysis of speech. Proceedings of the Second European Conference on Speech Communication and Technology (Eurospeech '91). 1367-1370.
Fiat, A., Karp R. M., Luby M., McGeoch L.. A., Sleator D.. D., & Young N.. E. (1991).  Competitive paging algorithms. Journal of Algorithms. 12(4), 685-699.
Hellerstein, L., & Karpinski M. (1991).  Computational Complexity of Learning Read-Once Formulas over Different Bases.
Grigoriev, D. Yu., Karpinski M., & Singer M. F. (1991).  Computational Complexity of Sparse Rational Interpolation.

Pages