Publications

Found 4101 results
Author Title [ Type(Desc)] Year
Conference Paper
Valente, F., Magimai-Doss M., Plahl C., Ravuri S., & Wang W. (2010).  A Comparative Large Scale Study of MLP Features for Mandarin ASR. 2630-2633.
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.
Vinyals, O., & Ravuri S. (2011).  Comparing Multilayer Perceptron to Deep Belief Network Tandem Features for Robust ASR.
Laskowski, K., & Shriberg E. (2010).  Comparing the Contributions of Context and Prosody in Text-Independent Dialog Act Recognition. 5374-5377.
Radoslavov, P., Papadopoulos C., Govindan R., & Estrin D. (2001).  A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast. Proceedings of the IEEE Infocom 2001.
Ferrer, L., Scheffer N., & Shriberg E. (2010).  A Comparison of Approaches for Modeling Prosodic Features in Speaker Recognition. 4414-4417.
Wester, M., & Fosler-Lussier E. (2000).  A Comparison of Data-Derived and Knowledge-Based Modeling of Pronunciation Variation. Proceedings of the 6th International Conference on Spoken Language Processing (ICSLP 2000).
Jamin, S., Shenker S., & 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.
Kääriäinen, M., & Langford J. (2005).  A Comparison of Tight Generalization Error Bounds. Proceedings of the 22nd International Conference on Machine Learning (ICML 2005). 409-416.
Lei, H., & Mirghafori N. (2008).  Comparisons of Recent Speaker Recognition Approaches Based on Word Conditioning.
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.

Pages