Publications

Found 1845 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is S  [Clear All Filters]
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 
C
Slager, S.. L., Skibola C. F., & Halperin E. (2012).  Common Variation at 6p21.31 (BAK1) Influences the Risk of Chronic Lymphocytic Leukemia. Blood. 120(4), 843-846.
Schilling, M., & Narayanan S. (2013).  Communicating with Executable Action Representations.
Medina, A., Taft N., Salamatian K., Bhattacharyya S., & Diot C. (2002).  Comparative Analysis of Traffic Matrix Estimation Methods.
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., & 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.
Marchini, J., Cutler D., Patterson N., Stephens M., Eskin E., Halperin E., et al. (2006).  A Comparison of Phasing Algorithms for Trios and Unrelated Individuals. American Journal of Human Genetics. 78(3), 437-450.
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.
Fiat, A., Karp R. M., Luby M., McGeoch L.. A., Sleator D.. D., & Young N.. E. (1991).  Competitive paging algorithms. Journal of Algorithms. 12(4), 685-699.
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.
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.
Blum, L., Cucker F., Shub M., & Smale S. (1995).  Complexity and Real Computation: A Manifesto.
Blum, L., Cucker F., Shub M., & Smale S. (1995).  Complexity and Real Computation: A Manifesto.
Santos, E. E. (1994).  Complexity Issues for Solving Triangular Linear Systems in Parallel.
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.

Pages