Publications

Found 4089 results
Author [ Title(Desc)] Type Year
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 
T
Feldman, J., Weber S. Hollbach, & Stolcke A. (1990).  A Testbed for the Miniature Language L0. Proceedings of the Fifth Rocky Mountain Conference on Artificial Intelligence.
Boulis, C., & Ostendorf M. (2005).  Text Classification by Augmenting the Bag-of-Words Representation with Redundancy-Compensated Bigrams. Proceedings of the SIAM International Conference on Data Mining at the Workshop on Feature Selection in Data Mining (SIAM-FSDM 2005).
Shriberg, E., & Ferrer L. (2007).  A Text-constrained Prosodic System for Speaker Verification. Proceedings of the 8th Annual Conference of the International Speech Communication Association (Interspeech 2007). 1226-1229.
Boakye, K., & Peskin B. (2004).  Text-Constrained Speaker Recognition on a Text-Independent Task. Proceedings of the Speaker and Language Recognition Workshop (Odyssey 2004).
Shenker, S. (1990).  A Theoretical Analysis of Feedback Flow Control. Proceedings of the ACM SIGCOMM Symposium on Communications Architectures & Protocols. 156-165.
Edmonds, J., & Karp R. M. (1972).  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of the Association for Computing Machinery. 19(2), 248-264.
Ben-David, S., Chor B., Goldreich O., & Luby M. (1989).  On the Theory of Average Case Complexity (Revised Edition).
Blum, L. (1990).  A Theory of Computation and Complexity Over the Real Numbers.
Blum, L., Shub M., & Smale S. (1988).  On a Theory of Computation and Complexity Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines.
Karp, R. M. (2012).  Theory of Computation as an Enabling Tool for the Sciences.
Karp, R. M. (2012).  Theory of Computation as an Enabling Tool for the Sciences.
Arnold, O.., & Jantke K.. P. (1994).  Therapy Plan Generation in Complex Dynamic Environments.
Friedland, G., Elizalde B. Martinez, Lei H., & Divakaran A. (2012).  There is No Data Like Less Data: Percepts for Video Concept Detection on Consumer-Produced Media.
Elizalde, B. Martinez, Friedland G., Lei H., & Divakaran A. (2012).  There is No Data Like Less Data: Percepts for Video Concept Detection on Consumer-Produced Media. 27-32.
Jeub, L. G. S., Balachandran P., Porter M. A., Mucha P. J., & Mahoney M. W. (2014).  Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks.
Egelman, S., Kannavara R., & Chow R. (2015).  Is This Thing On? Crowdsourcing Privacy Indicators for Ubiquitous Sensing Platforms. Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI ’15).
McCauley, J., Panda A., Krishnamurthy A., & Shenker S. (2019).  Thoughts on Load Distribution and the Role of Programmable Switches. Newsletter of ACM SIGCOMM Computer Communication Review. 49(1), 18-23.
Allman, M. (2008).  Thoughts on Reviewing. ACM Computer Communication Review. 38(2), 47-50.
Holtkamp, M. (1997).  Thread Migration with Active Threads.
Karp, R. M. (2009).  Three Combinatorial Problems in Computational and Genomic Biology.
Hadziosmanovic, D., Sommer R., Zambon E., & Hartel P. (2013).  Through the Eye of the PLC: Towards Semantic Security Monitoring for Industrial Control Systems.
Chun, B-G., Maniatis P., Shenker S., & Kubiatowicz J. D. (2009).  Tiered Fault Tolerance for Long-Term Integrity. 267-282.
Elsässer, R., & Sauerwald T. (2009).  Tight Bounds for the Cover Time of Multiple Random Walks. 415-426.
Chuzhoy, J., Guha S., Halperin E., Khanna S., Kortsarz G., & Naor S.. (2004).  Tight Lower Bounds for the Asymetric k-Center Problem. Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04).
Fillmore, C. J. (1971).  Time. 28-37.

Pages