Publications

Found 4113 results
Author Title Type [ Year(Asc)]
1989
Munro, P. W. (1989).  Conjectures on Representations in Backpropagation Networks.
Stolcke, A. (1989).  A Connectionist Model of Unification.
Feldman, J. (1989).  Connectionist Representation of Concepts. 25-45.
Cleve, R., & Dagum P. (1989).  A Constructive Omega(t(superscript 1.26)) Lower Bound for the Ramsey Number R (3,t).
Cleve, R. (1989).  Controlled Gradual Disclosure Schemes for Random Bits and Their Applications.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the 3MIS Problem.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO).
Kay, R. (1989).  The Establishment of the International Computer Science Institute in Berkeley, California: Venturing with Norbert.
Diederich, J. (1989).  Explanation and Connectionist Systems.
Gibson, G. A., Hellerstein L., Karp R. M., Katz R. H., & Patterson D. (1989).  Failure correction techniques for large disk arrays. Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-III). 123-132.
Damaskos, S., & Verma D. C. (1989).  Fast Establishment of Real-Time Channels.
Reischuk, R. (1989).  Fast Evaluation of Boolean Formulas by CREW-PRAMs.
Moody, J. (1989).  Fast Learning in Multi-Resolution Hierarchies.
Moody, J., & Darken C. (1989).  Fast Learning in Networks of Locally-Tuned Processing Units. 1, 289-303.
Dahlhaus, E., Karpinski M., & Novick M. B. (1989).  Fast Parallel Algorithms for the Clique Separator Decomposition.
Chen, M-S., & Shin K. G. (1989).  Fault-Tolerant Routing in Hypercube Multicomputers Using Depth-First Search.
Omohundro, S. (1989).  Five Balltree Construction Algorithms.
Morgan, N., & Bourlard H. (1989).  Generalization and Parameter Estimation in Feedforward Nets: Some.
Omohundro, S. (1989).  Geometric Learning Algorithms.
Ferrari, D. (1989).  Guaranteeing Performance for Real-Time Communication in Wide-Area Networks.
Staff, ICSI. (1989).  ICSI Annual Report 1988-1989.
Hellerstein, L., & Karpinski M. (1989).  Learning Read-Once Formulas Using Membership Queries.
Angluin, D., Hellerstein L., & Karpinski M. (1989).  Learning Read-Once Formulas with Queries.
Blum, L. (1989).  Lectures on a Theory of Computation and Complexity over the Reals.
Dagum, P. (1989).  A Linear-Time Algorithm for Enumerating Perfect Matchings in Skew Bipartite Graphs.

Pages