Publications

Found 4258 results
Author [ Title(Asc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
R
Hermansky, H., & Morgan N. (1994).  RASTA Processing of Speech. IEEE Transactions on Speech and Audio Processing. 2(4), 578-589.
Morgan, N., & Hermansky H. (1992).  RASTA Extensions: Robustness to Additive and Convolutional Noise. Proceedings of the Workshop on Speech Processing in Adverse Conditions. 115-118.
Freytag, A., Rodner E., Bodesheim P., & Denzler J. (2012).  Rapid Uncertainty Computation with Gaussian Processes and Histogram Intersection Kernels.
Shastri, L. (1997).  Rapid Learning of Binding-Match and Binding-Error Detector Circuits via Long-Term Potentiation.
Rejaie, R., Handley M., & Estrin D. (1999).  RAP: An End-to-End Rate-Based Congestion Control Mechanism for Realtime Streams in the Internet. Proceedings of Infocom 1999.
Weaver, N. (2021).  The Ransomware Problem Is a Bitcoin Problem.
Geiger, A., Urtasun R., & Darrell T. (2009).  Rank Priors for Continuous Non-Linear Dimensionality Reduction. 880-887.
Urtasun, R., Geiger A., & Darrell T. (2009).  Rank Priors for Continuous Non-Linear Dimensionality Reduction.
Blömer, J., Karp R. M., & Welzl E. (1997).  The Rank of Sparse Random Matrices Over Finite Fields. Random Structures and Algorithms. 10,
Blömer, J., Karp R. M., & Welzl E. (1996).  The Rank of Sparse Random Matrices Over Finite Fields.
Ratnasamy, S., Hellerstein J. M., & Shenker S. J. (2003).  Range Queries Over DHTs.
Karpinski, M., & Verbeek R. (1992).  On Randomized Versus Deterministic Computation.
Karp, R. M., Schindelhauer C., Shenker S. J., & Vocking B.. (2000).  Randomized Rumor Spreading. Proceedings of the IEEE 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 565-574.
Karp, R. M., & Zhang Y. (1988).  A randomized parallel branch-and-bound procedure. Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
Karp, R. M., & Zhang Y. (1993).  Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the Association for Computing Machinery. 40(3), 765-789.
Mavronicolas, M., & Sauerwald T. (2009).  A Randomized, O(log w)-Depth 2-Smoothing Network. 178-187.
Grigoriev, D. Yu., & Karpinski M. (1996).  Randomized ?(n^2) Lower Bound for Knapsack.
Gasieniec, L., Karpinski M., Plandowski W., & Rytter W. (1996).  Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach.
Bürgisser, P., Karpinski M., & Lickteig T. Michael (1992).  On Randomized Algebraic Test Complexity.
Kimmel, G., Jordan M. I., Halperin E., Shamir R., & Karp R. M. (2007).  A Randomization Test for Controlling Population Stratification in Whole-Genome Association Studies. American Journal of Human Genetics. 81(5), 895-905.
Aleliunas, R., Karp R. M., Lipton R. J., & Lovász L. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface. 174-176.
Aleliunas, R., Karp R. M., Lipton R. J., Lovász L., & Rackoff C. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science. 218-223.
Hernek, D. (1995).  Random Walks on Colored Graphs: Analysis and Applications.
Yang, J., Sindhwani V., Fan Q., Avron H., & Mahoney M. (2014).  Random Laplace Feature Maps for Semigroup Kernels on Histograms.
Liu, X., & Shapiro V. (2015).  Random heterogeneous materials via texture synthesis. Computational Materials Science. 99, 177-189.

Pages