Publications

Found 4169 results
Author Title [ Type(Desc)] Year
Conference Paper
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.
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive analysis of financial games. Proceedings 33rd Annual Symposium on Foundations of Computer Science. 327-333.
Shetty, N., Schwartz G., Felegyhazi M., & Walrand J. (2009).  Competitive Cyber-Insurance and Internet Security.
Hampton, M.., & Asanović K. (2008).  Compiling for Vector-Thread Architectures. 205-215.
Harren, M.., Hellerstein J. M., Huebsch R., Loo B. Thau, Shenker S., & Stoica I. (2002).  Complex Queries in DHT-based Peer-to-Peer Networks. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02). 2429, 242-250.
Gramm, J., Nierhoff T., Sharan R., & Tantau T. (2004).  On the Complexity of Haplotyping via Perfect Phylogeny. Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. 35-46.
Karp, R. M. (1985).  The complexity of parallel computation. Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing. 1.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
Beame, P., Karp R. M., Pitassi T., & Saks M. (1998).  On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
Pan, H., Hindman B., & Asanović K. (2010).  Composing Parallel Software Efficiently with Lithe. 376-387.
Schryen, G. (2009).  A Comprehensive and Comparative Analysis of the Patching Behavior of Open Source and Closed Source Software Vendors. 153-168.
Ellis, D. P. W. (1997).  Computational Auditory Scene Analysis Exploiting Speech-Recognition Knowledge. Proceedings of the IEEE Workshop on Applications of Signal Processing to Audio and Acoustics. 4.
Feldman, J. (1988).  Computational Constraints on Higher Neural Representations. Proceedings of the System Development Foundation Symposium on Computational Neuroscience.
Shastri, L. (1993).  A Computational Model of Tractable Reasoning -- Taking Inspiration from Cognition. Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 93). 202-207.
Ben-David, Y., Hasan S., Pal J., Vallentin M., Panjwani S.., Gutheim P.., et al. (2011).  Computing Security in the Developing World: A Case for Multidisciplinary Research. 39-44.
Baswana, S., Biswas S., Doerr B., Friedrich T., Kurur P., & Neumann F. (2009).  Computing Single Source Shortest Paths Using Single-Objective Fitness Functions. 59-66.
Tsai, T.. J., & Janin A. (2013).  Confidence-Based Scoring: A Useful Diagnostic Tool for Detection Tasks.
Liu, D., Allman M., Jin S., & Wang L. (2007).  Congestion Control Without a Startup Phase.
Krause, M., Hall M., Williams J. Jay, Paritosh P., Prip J., & Caton S. (2016).  Connecting Online Work and Online Education at Scale. Proceedings of the 2016 CHI Conference Extended Abstracts on Human Factors in Computing Systems. 3536-3541.
Shastri, L., Grannes D. Jeffrey, Narayanan S., & Feldman J. (1999).  A Connectionist Encoding of Parameterized Schemas and Reactive Plans. Proceedings of the First SMART-Symposium. 1-28.
Abrash, V., Cohen M., Franco H., Morgan N., & Konig Y. (1992).  Connectionist Gender Adaptation in a Hybrid Neural Network / Hidden Markov Model Speech Recognition System. Proceedings of the International Conference on Spoken Language Processing (ICSLP'92). 911-914.
Garagnani, M., Shastri L., & Wendelken C. (2002).  A Connectionist Model of Planning via Back-Chaining Search. Proceedings of the 24th Annual Conference of the Cognitive Science Society (CogSci 2002).
Garagnani, M., Shastri L., & Wendelken C. (2001).  A Connectionist Model of Planning via Back-Chaining Search. Proceedings of the 20th Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2001).
Renals, S., Morgan N., Cohen M., Bourlard H., & Franco H. (1992).  Connectionist Probability Estimation in the Decipher Speech Recognition System. Proceedings of the IEEE International Conference on Acoustics, Speech & Signal Processing (ICASSP 1992). I601-I604.

Pages