Publication Search Results

TitleAuthorBibliographicDatesort descendingGroupLinks
Fast Learning in Networks of Locally-Tuned Processing UnitsJ. Moody and C. DarkenNeural Computation, Vol. 1, pp. 289-303 1989Algorithms
Merging Multilayer Perceptrons & Hidden Markov Models: Some Experiments in Continuous Speech RecognitionH. Bourlard and N. MorganICSI Technical Report TR-089-033 1989Speech
Generalization and Parameter Estimation in Feedforward Nets: Some ExperimentsH. Bourlard and N. MorganICSI Technical Report TR-089-017. Also published in Advances in Neural Information Processing Systems, Vol. II, pp. 630-637, 1990. 1989Speech
A Multi-DSP Ring Array for Connectionist SimulationsJ. Beck, N. Morgan, A. Allman, and J. BeerProceedings of 23rd Asilomar Conference on Signals, Systems & Computers 1989Speech
A Temporal Extension of the Four Frames ModelJ.A. FeldmanModels of Brain Function, pp. 423-441, Rodney M. J. Cotterill (ed.), Cambridge University Press 1989AI
Connectionist Representation of ConceptsJ.A. FeldmanConnectionism in Perspective, pp. 25-45, R. Pfeifer (ed.), Elsevier Science Publishers B.V. 1989AI
Massively Parallel Computational ModelsJ.A. FeldmanChapter 5 in Quantitative Analyses of Behavior: Vol. 8. Also in Pattern Recognition and Concept Formation in Animals, People, and Machines, M. L. Commons, R. J. Herrnstein, S. M. Kosslyn, and D. B. Mumford (eds.), Harvard University Press 1989AI
Neural Representations of Conceptual KnowledgeJ.A. FeldmanNeural Connections, Mental Computation, L. Nadel, et al. (eds.), Bradford Books. Also in Review of Cognitive Science, N. Sharkey (ed.), Ablex Publishing Corporation 1989AI
Annual Report 1988-1989ICSI Staff 1989ICSI Annual Reports[PDF]

Guaranteeing Performance for Real-Time Communication in Wide-Area NetworksD. FerrariICSI Technical Report TR-89-001January 1989ICSI Technical Reports[PDF]

What Lies AheadJ.A. FeldmanBYTE Magazine, McGraw-Hill PublicationJanuary 1989AI
Pseudo-Random Number Generator From ANY One-Way FunctionR. Impagliazzo and M. LubyICSI Technical Report TR-89-002February 1989ICSI Technical Reports[PDF]

Parallel Search for Maximal Independence Given Minimal DependenceP. Beame and M. LubyICSI Technical Report TR-89-003February 1989ICSI Technical Reports[PDF]

Towards a Theory of Average Case ComplexityS. Ben-David, B. Chor, O. Goldreich, and M. LubyICSI Technical Report TR-89-004February 1989ICSI Technical Reports[PDF]

A Study of Password SecurityM. Luby and C. RackoffICSI Technical Report TR-89-005February 1989ICSI Technical Reports[PDF]

Fault-Tolerant Routing in Hypercube Multicomputers Using Depth-First SearchM.-S. Chen and K. G. ShinICSI Technical Report TR-89-006February 1989ICSI Technical Reports[PDF]

A Linear-Time Algorithm for Enumerating Perfect Matchings in Skew Bipartite GraphsP. DagumICSI Technical Report TR-89-007February 1989ICSI Technical Reports
Spreading Activation and Connectionist Models for Natural Language ProcessingJ. DiederichICSI Technical Report TR-89-008February 1989ICSI Technical Reports[PDF]

A Constructive Omega(t(superscript 1.26)) Lower Bound for the Ramsey Number R (3,t)R. Cleve and P. DagumICSI Technical Report TR-89-009February 1989ICSI Technical Reports[PDF]

Conceptual Hierarchies in Classical and Connectionist ArchitectureA. KobsaICSI Technical Report TR-89-010February 1989ICSI Technical Reports[PDF]

Program Checkers for Algebraic Problems (Thesis)S. KananICSI Technical Report TR-89-064February 1989ICSI Technical Reports
Preemptive Ensemble Motion Planning on a TreeG. N. Frederickson and D. J. GuanICSI Technical Report TR-89-011March 1989ICSI Technical Reports[PDF]

Nonpreemptive Ensemble Motion Planning on a TreeG. N. Frederickson and D. J. GuanICSI Technical Report TR-89-012March 1989ICSI Technical Reports[PDF]

The Establishment of the International Computer Science Institute in Berkeley, California: Venturing with NorbertR. KayICSI Technical Report TR-89-013March 1989ICSI Technical Reports[PDF]

Subtree Isomorphism is in Random NCP. Gibbons, R. M. Karp, G. L. Miller, and D. SorokerICSI Technical Report TR-89-014March 1989ICSI Technical Reports[PDF]

Planar Graph Decomposition and All Pairs Shortest PathsG. N. FredericksonICSI Technical Report TR-89-015March 1989ICSI Technical Reports[PDF]

Monitoring and Measuring Parallel Systems Using a Non-Intrusive Rule-BasedD. Haban and D. WybranietzICSI Technical Report TR-89-030March 1989ICSI Technical Reports[PDF]

Explanation and Connectionist SystemsJ. DiederichICSI Technical Report TR-89-016April 1989ICSI Technical Reports[PDF]

Generalization and Parameter Estimation in Feedforward Nets: SomeN. Morgan and H. BourlardICSI Technical Report TR-89-017April 1989ICSI Technical Reports[PDF]

A Parallel Algorithm for Maximum Matching in Planar GraphsM. Karpinski, E. Dahlhaus, and A. LingasICSI Technical Report TR-89-018April 1989ICSI Technical Reports[PDF]

A More Practical PRAM ModelP. B. GibbonsICSI Technical Report TR-89-019April 1989ICSI Technical Reports[PDF]

Multiple Network Embeddings into HypercubesA. Gupta and S. E. HambruschICSI Technical Report TR-89-020April 1989ICSI Technical Reports[PDF]

Learning Read-Once Formulas Using Membership QueriesL. Hellerstein and M. KarpinskiICSI Technical Report TR-89-021April 1989ICSI Technical Reports[PDF]

Approximating the Permanent of Graphs with Large FactorsP. Dagum and M. LubyICSI Technical Report TR-89-023April 1989ICSI Technical Reports[PDF]

Failure correction techniques for large disk arraysG.A. Gibson, L. Hellerstein, R. M. Karp, R.H. Katz, and D.A. PattersonProceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-III), Boston, Massachusetts, pp.123-32April 1989Algorithms
Real-Time Communication in Packet-Switching Wide-Area NetworksD. FerrariICSI Technical Report TR-89-022May 1989ICSI Technical Reports[PDF]

An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO)E. Dahlhaus and M. KarpinskiICSI Technical Report TR-89-024May 1989ICSI Technical Reports[PDF]

On Parallel Evaluation of Game TreesR. M. Karp and Y. ZhangICSI Technical Report TR-89-025May 1989ICSI Technical Reports[PDF]

Separating Abstraction from Implementation in Communication Network DesignR. CaceresICSI Technical Report TR-89-026May 1989ICSI Technical Reports[PDF]

Boolean Circuit Complexity of Algebraic Interpolation ProblemsM. KarpinskiICSI Technical Report TR-89-027May 1989ICSI Technical Reports[PDF]

Application of Real-Time Monitoring to Scheduling Tasks with RandomD. Haban and K. ShinICSI Technical Report TR-89-028May 1989ICSI Technical Reports[PDF]

Behavior and Performance Analysis of Distributed Systems Using a HybridD. Haban and D. WybranietzICSI Technical Report TR-89-029May 1989ICSI Technical Reports[PDF]

One-Way Functions Are Essential for Complexity Based Cryptography (ExtendedR. Impagliazzo and M. LubyICSI Technical Report TR-89-031May 1989ICSI Technical Reports[PDF]

A Connectionist Model of UnificationA. StolckeICSI Technical Report TR-89-032May 1989ICSI Technical Reports[PDF]

A Survey of Optical Fibers in CommunicationR. Govindan, S. Keshav, and D. C. VermaICSI Technical Report TR-89-034May 1989ICSI Technical Reports[PDF]

Conjectures on Representations in Backpropagation NetworksP. W. MunroICSI Technical Report TR-89-035May 1989ICSI Technical Reports[PDF]

A Scheme for Real-Time Channel Establishment in Wide-Area NetworksD. Ferrari and D. C. VermaICSI Technical Report TR-89-036May 1989ICSI Technical Reports[PDF]

A Tagging Method for Distributed Constraint SatisfactionH. W. GuesgenICSI Technical Report TR-89-037June 1989ICSI Technical Reports[PDF]

Metric Constraint Satisfaction with IntervalsP. B. LadkinICSI Technical Report TR-89-038June 1989ICSI Technical Reports[PDF]

Geometric Learning AlgorithmsS. M. OmohundroICSI Technical Report TR-89-041June 1989ICSI Technical Reports[PDF]

Pages