Publications

Found 245 results
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is G  [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 
G
Greenberg, S. (1997).  On the Origins of Speech Intelligibility in the Real World. Proceedings of the ESCA Workshop of Robust Speech Recognition. 23-32.
Greenberg, S., & Arai T. (2001).  The Relation Between Speech Intelligibility and the Complex Modulation Spectrum. Proceedings of the 7th European Conference on Speech Communication and Technology (Eurospeech 2001).
Greenberg, S. (1996).  Understanding Speech Understanding. Proceedings of the ESCA Workshop on the "Auditory Basis of Speech Perception. 1-8.
Graupner, S., Kalfa W., & Schubert F. (1994).  Multi-Level Architecture of Object-Oriented Operating Systems.
Grant, K.. W., & Greenberg S. (2001).  Speech Intelligibility Derived From Asynchrounous Processing of Auditory-Visual Information. Proceedings of the International Conference on Auditory-Visual Speech Processing Workshop (AVSP 2001).
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.
Gramm, J., Ben-Dor A., & Sharan R. (2004).  Experimental Design for Multiplexed SNP Genotyping.
Gramm, J., Guo J., & Niedermeier R. (2004).  Pattern Matching for Arc-Annotated Sequences. Journal of Algorithms.
Gramm, J. (2004).  A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. Proceedings of the Fourth International Workshop on Algorithms in Bioinformatics (WABI 2004).
Gramm, J., Guo J., & Niedermeier R. (2004).  Parameterized Intractability of Distinguishing Substring Selection. Theory of Computing Systems.
Gramm, J., Guo J., Hüffner F., & Niedermeier R. (2004).  Automated Generation of Search Tree Algorithms for Hard Graph-Modification Problems. Algorithmica. 39(4), 321-347.
Gramm, J., Nierhoff T., & Tantau T. (2004).  Perfect Path Phylogeny Haplotyping with Missing Data is Fixed-Parameter Tractable. Proceedings of the First International Workshop on Parameterized and Exact Computation (IWPEC 2004).
Gramm, J., Guo J., Hüffner F., & Niedermeier R. (2004).  Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. Theory of Computing Systems.
Graciarena, M., Delplanche M., Shriberg E., & Stolcke A. (2011).  Bird Species Recognition Combining Acoustic and Sequence Modeling. 341-344.
Graciarena, M., Alwan A., Ellis D. P. W., Franco H., Ferrer L., Hansen J. H. L., et al. (2013).  Feature Combination for Highly Channel-Degraded Speech Activity Detection.
Graciarena, M., Delplanche M., Shriberg E., Stolcke A., & Ferrer L. (2010).  Acoustic Front-End Optimization for Bird Species Recognition. 293-296.
Graciarena, M., Bocklet T., Shriberg E., Stolcke A., & Kajarekar S. (2009).  Feature-Based and Channel-Based Analyses of Intrinsic Variability in Speaker Verification. 2015-2018.
Graciarena, M., Kajarekar S., Stolcke A., & Shriberg E. (2007).  Noise Robust Speaker Identification for Spontaneous Arabic Speech. Proceedings of the 32nd IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2007). 4, 245-248.
Govindan, R., Keshav S., & Verma D. C. (1989).  A Survey of Optical Fibers in Communication.
Govindan, R., & Radoslavov P. (2002).  An Analysis of The Internal Structure of Large Autonomous Systems.
Govindan, R., & Paxson V. (2002).  Estimating Router ICMP Generation Delays. Proceedings of Passive & Active Measurement: PAM-2002.
Govil, K., Chan E., & Wasserman H. (1995).  Comparing Algorithms for Dynamic Speed-Setting of a Low-Power CPU.
Gottlieb, L., & Friedland G. (2009).  On the Use of Artificial Conversation Data for Speaker Recognition in Cars. 124-128.
Gottlieb, L., Choi J., Kelm P., Sikora T., & Friedland G. (2012).  Pushing the Limits of Mechanical Turk: Qualifying the Crowd for Video Geo-Location. 23-28.
Gottlieb, L., Friedland G., Choi J., Kelm P., & Sikora T. (2014).  Creating Experts From the Crowd: Techniques for Finding Workers for Difficult Tasks. IEEE Transactions on Multimedia. 16(7), 2075-2079.

Pages