Publications

Found 1144 results
Author Title [ Type(Asc)] Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
Conference Paper
Hein, T.., & Kramer O. (2010).  Recognition and Visualization of Music Sequences Using Self-Organizing Feature Maps. 160-167.
Beamer, S., Sun C.., Kwon Y-J., Joshi A., Batten C., Stojanovic V., et al. (2010).  Re-Architecting DRAM Memory Systems with Monolithically Integrated Silicon Photonics. 129-140.
Colmenares, J. A., Saxton I., Battenberg E., Avižienis R., Peters N., Asanović K., et al. (2011).  Real-Time Musical Applications on an Experimental Operating System for Multi-Core Processors.
Kohler, E., M. Kaashoek F., & Montgomery D. R. (1999).  A Readable TCP in the Prolac Protocol Language. Proceedings of the ACM SIGCOMM '99 Conference.
Kohler, E., M. Kaashoek F., & Montgomery D. R. (1999).  A Readable TCP in the Prolac Protocol Language. Proceedings of the ACM SIGCOMM '99 Conference.
Hermansky, H., Morgan N., Bayya A., & Kohn P. (1992).  RASTA-PLP Speech Analysis Technique. Proceedings of IEEE International Conference on Acoustics, Speech & Signal Processing.
Karp, R. M., Schindelhauer C., Shenker S. J., & Vocking B.. (2000).  Randomized Rumor Spreading. Proceedings of the IEEE 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 565-574.
Karp, R. M., & Zhang Y. (1988).  A randomized parallel branch-and-bound procedure. Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
Aleliunas, R., Karp R. M., Lipton R. J., Lovász L., & Rackoff C. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science. 218-223.
Aleliunas, R., Karp R. M., Lipton R. J., & Lovász L. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface. 174-176.
Khodapanah, B., Awada A., Viering I., Francis J., Simsek M., & Fettweis G. (2019).  Radio Resource Management in Context of Network Slicing: What is Missing in Existing Mechanisms?. Proceedings of the IEEE Wireless Communications and Networking Conference 2019.
Doerr, B., Friedrich T., Künneman M.., & Sauerwald T. (2009).  Quasirandom Rumor Spreading: An Experimental Analysis. 145-153.
Adami, A., Burget L., Dupont S., Garudadri H., Grezl F., Hermansky H., et al. (2002).  Qualcomm-ICSI-OGI Features for ASR. Proceedings of the 7th International Conference on Spoken Language Processing (ICSLP 2002).
Shen, S.., Dong Z.., Ye J.., Ma L.., Yao Z.., Gholami A.., et al. (2020).  Q-BERT: Hessian Based Ultra Low Precision Quantization of BERT. Proceedings of the AAAI-20 Conference.
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.
Harchol, Y., Bergemann D., Feamster N., Friedman E., Krishnamurthy A., Panda A., et al. (2020).  A Public Option for the Core. SIGCOMM '20: Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication. 377-39.
Rossow, C., Dietrich C. J., Kreibich C., Grier C., Paxson V., Pohlmann N., et al. (2012).  Prudent Practices for Designing Malware Experiments: Status Quo and Outlook. 65-79.
Cui, W., Paxson V., Weaver N., & Katz R. H. (2006).  Protocol-Independent Adaptive Replay of Application Dialog. Proceedings of the 13th Annual Symposium on Network and Distributed System Security (NDSS'06).
Ang, J., Dhillon R., Krupski A., Shriberg E., & Stolcke A. (2002).  Prosody-Based Automatic Detection of Annoyance and Frustration in Human-Computer Dialog. Proceedings of the 7th International Conference on Spoken Language Processing (ICSLP 2002).
Kohler, E., Morris R., & Chen B. (2002).  Programming Language Optimizations for Modular Router Configurations. Proceedings of the Tenth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X).
DiCioccio, L., Teixeira R., May M., & Kreibich C. (2012).  Probe and Pray: Using UPnP for Home Network Measurements. 96-105.
Karayev, S., Fritz M., Fidler S., & Darrell T. (2011).  A Probabilistic Model for Recursive Factorized Image Features. 401-408.
Karp, R. M. (1979).  Probabilistic Analysis of Graph-theoretic Algorithms. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
Allman, M., Kreibich C., Paxson V., Sommer R., & Weaver N. (2008).  Principles for Developing Comprehensive Network Visibility.
Kohli, P., Osokin A., & Jegelka S. (2013).  A Principled Deep Random Field for Image Segmentation. 1971-1978.

Pages