Publications

Found 1886 results
Author Title [ Type(Desc)] Year
Filters: First Letter Of Last Name is S  [Clear All Filters]
Conference Paper
Zheng, J., etin Ö. Ç., Huang M.-Y.., Lei X., Stolcke A., & Morgan N. (2007).  Combining Discriminative Feature, Transform, and Model Training for Large Vocabulary Speech Recognition. 4, 633-636.
Hatch, A., Stolcke A., & Peskin B. (2005).  Combining Feature Sets with Support Vector Machines: Application to Speaker Recognition. Proceedings of IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU 2005). 75-79.
Demers, A. J., Weiser M., Hayes B., Boehm H-J.., Bobrow D., & Shenker S. J. (1990).  Combining Generational and Conservative Garbage Collection: Framework and Implementations. Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). 261-269.
Breslau, L., Jamin S., & Shenker S. J. (2000).  Comments on the Performance of Measurement-Based Admission Control Algorithms. Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000). 3, 1233-1242.
Schilling, M., & Narayanan S. (2013).  Communicating with Executable Action Representations.
Liu, Y., Stolcke A., Shriberg E., & Harper M. P. (2004).  Comparing and Combining Generative and Posterior Probability Models: Some Advances in Sentence Boundary Detection in Speech. Proceedings of Conference on Empirical Methods in Natural Language Processing.
Liu, Y., Stolcke A., Shriberg E., & Harper M. P. (2004).  Comparing and Combining Generative and Posterior Probability Models: Some Advances in Sentence Boundary Detection in Speech. Proceedings of Conference on Empirical Methods in Natural Language Processing.
Meyer, B. T., Ravuri S., Schädler M. René, & Morgan N. (2011).  Comparing Different Flavors of Spectro-Temporal Features for ASR. 1269-1272.
Liu, Y., & Shriberg E. (2007).  Comparing Evaluation Metrics for Sentence Boundary Detection. 4, 185-188.
Liu, Y., Shriberg E., Stolcke A., & Harper M. P. (2005).  Comparing HMM, Maximum Entropy, and Conditional Random Fields for Disfluency Detection. Proceedings of the 9th European Conference on Speech Communication and Technology (Interspeech 2005-Eurospeech 2005). 3313-3316.
Liu, Y., Shriberg E., Stolcke A., & Harper M. P. (2005).  Comparing HMM, Maximum Entropy, and Conditional Random Fields for Disfluency Detection. Proceedings of the 9th European Conference on Speech Communication and Technology (Interspeech 2005-Eurospeech 2005). 3313-3316.
Laskowski, K., & Shriberg E. (2010).  Comparing the Contributions of Context and Prosody in Text-Independent Dialog Act Recognition. 5374-5377.
Ferrer, L., Scheffer N., & Shriberg E. (2010).  A Comparison of Approaches for Modeling Prosodic Features in Speaker Recognition. 4414-4417.
Ferrer, L., Scheffer N., & Shriberg E. (2010).  A Comparison of Approaches for Modeling Prosodic Features in Speaker Recognition. 4414-4417.
Jamin, S., Shenker S. J., & Danzig P. B. (1997).  Comparison of Measurement-Based Admission Control Algorithms for Controlled-Load Service. Proceedings of the Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 3, 973-980.
Shetty, N., Schwartz G., Felegyhazi M., & Walrand J. (2009).  Competitive Cyber-Insurance and Internet Security.
Shetty, N., Schwartz G., Felegyhazi M., & Walrand J. (2009).  Competitive Cyber-Insurance and Internet Security.
Harren, M.., Hellerstein J. M., Huebsch R., Loo B. Thau, Shenker S. J., & 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.
Harren, M.., Hellerstein J. M., Huebsch R., Loo B. Thau, Shenker S. J., & 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.
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.
Schryen, G. (2009).  A Comprehensive and Comparative Analysis of the Patching Behavior of Open Source and Closed Source Software Vendors. 153-168.
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.
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.
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).

Pages