Publications

Found 642 results
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is R  [Clear All Filters]
1992
Ramaekers, J., & Ventre G. (1992).  Quality-of-Service Negotiation in a Real-Time Communication Network.
Feldman, J., Lim C-C., & Rauber T. (1992).  The Shared-Memory Language pSather on a Distributed-Memory Multiprocessor. Proceedings of the ACM Special Interest Group on Programming Languages (SIGPLAN). 17-20.
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.
Renals, S., Morgan N., Bourlard H., Cohen M., & Franco H. (1991).  Connectionist Optimisation of Tied Mixture Hidden Markov Models. IV, 167-174.
Renals, S., Morgan N., Bourlard H., Cohen M., Franco H., Wooters C., et al. (1991).  Connectionist Speech Recognition: Status and Prospects.
Rieger, B. B. (1991).  On Distributed Representation in Word Semantics.
Ladkin, P., & Reinefeld A. (1991).  How to Solve Interval Constraint Networks: The Definitive Answer - Probably.
Bernini, C.., Codenotti B., Leoncini M., & Resta G. (1991).  Incomplete Factorizations for Certain Toeplitz Matrices.
Regier, T. (1991).  Learning Spatial Concepts Using a Partially-Structured Connectionist Architecture.
Regier, T. (1991).  Line Labeling Using Markov Random Fields.
Codenotti, B., Leoncini M., & Resta G. (1991).  Oracle Computations in Parallel Numerical Linear Algebra.
Renals, S., Morgan N., & Bourlard H. (1991).  Probability Estimation by Feed-forward Networks in Continuous Speech Recognition. Proceedings of the IEEE Workshop on Neural Networks for Signal Processing. 309-318.
Renals, S., Morgan N., & Bourlard H. (1991).  Probability Estimation by Feed-Forward Networks in Continuous Speech Recognition.
Blum, M. E., Luby M., & Rubinfeld R. (1991).  Self-Testing/Correcting with Applications to Numerical Problems (Revised Version).
Gibbons, P. B., Karp R. M., Ramachandran V., Soroker D., & Tarjan R.. (1991).  Transitive Compaction in Parallel via Branchings. Journal of Algorithms. 12(1), 110-125.
1990
Rubinfeld, R. (1990).  Designing Checkers for Programs that Run in Parallel.
Regier, T. (1990).  Learning Spatial Terms Without Explicit Negative Instances.
Rubinfeld, R. (1990).  A Mathematical Theory of Self-Checking, Self-Testing and Self-Correcting Programs (Thesis).
Blum, M. E., Luby M., & Rubinfeld R. (1990).  Self-Testing/Correcting with Applications to Numerical Problems.
Ladkin, P., Anger F. D., & Rodriguez R. V. (1990).  Temporal Resoning with Intervals in Branching Time.
1989
Reischuk, R. (1989).  Fast Evaluation of Boolean Formulas by CREW-PRAMs.
Luby, M., & Rackoff C. (1989).  A Study of Password Security.
1988
Karp, R. M., Motwani R., & Raghaven P.. (1988).  Deferred Data Structuring. SIAM Journal on Computing. 17(5), 883-902.
1987
Karp, R. M., & Rabin M.. O. (1987).  Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development. 31(2), 249-260.

Pages