Publications

Found 178 results
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is R  [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 
R
Ravuri, S., & Morgan N. (2012).  Easy Does It: Robust Spectro-Temporal Many-Stream ASR Without Fine Tuning Streams. 4309-4312.
Ravanelli, M., Elizalde B. Martinez, Bernd J., & Friedland G. (2015).  Insights into Audio-Based Multimedia Event Classification with Neural Networks. 19-23.
Ratnasamy, S., Shenker S., & McCanne S. (2005).  Towards an Evolvable Internet Architecture. Proceedings of ACM Special Interest Group on Data Communications Conference (SIGCOMM 2005). 313-324.
Ratnasamy, S., Karp B., Yin L., Yu F., Estrin D., Govindan R., et al. (2002).  GHT: A Geographic Hash-table for Data-centric Storage in Sensornets.
Ratnasamy, S., Ermolinskiy A., & Shenker S. (2006).  Revisiting IP Multicast. Proceedings of ACM Special Interest Group on Data Communications Conference (SIGCOMM 2006). 15-26.
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. (2001).  A Scalable Content-Addressable Network. Proceedings of ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 161-172.
Ratnasamy, S., Hellerstein J. M., & Shenker S. (2003).  Range Queries Over DHTs.
Ratnasamy, S., Handley M., Karp R. M., & Shenker S. (2002).  Topologically-Aware Overlay Construction and Server Selection. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002). 3, 1190-1199.
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. (2001).  A Scalable Content-Addressable Network. ACM SIGCOMM Computer Communication Review. 31(4), 161-172.
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. (2000).  A Scalable Content Addressable Network.
Ratnasamy, S., Stoica I., & Shenker S. (2002).  Routing Algorithms for DHTs: Some Open Questions. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS). 45-52.
Ratnasamy, S., Handley M., Karp R. M., & Shenker S. (2001).  Application-Level Multicast Using Content-Addressable Networks. 2233, 14-29.
Ratnasamy, S., Karp B., Shenker S., Estrin D., Govindan R., Yin L., et al. (2003).  Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table. 8(4), 427-442.
Rasti, R., Murthy M., Weaver N., & Paxson V. (2015).  Temporal Lensing and its Application in Pulsing Denial-of-Service Attacks.
Rasti, R., Murthy M., & Paxson V. (2014).  Temporal Lensing and its Application in Pulsing Denial of Service Attacks.
Raskutti, G., & Mahoney M. W. (2014).  A Statistical Perspective on Randomized Sketching for Ordinary Least-Squares.
Rao, A., Lakshminarayanan K., Stoica I., & Shenker S. (2002).  Flexible and Robust Large Scale Multicast Using i3.
Rao, A., Ratnasamy S., Papadimitriou C. H., Shenker S., & Stoica I. (2003).  Geographic Routing Without Location Information. Proceedings of the 9th ACM Annual International Conference on Mobile Computing and Networking (MOBICOMM '03). 96-108.
Rao, A., Lakshminarayanan K., Surana S., Karp R. M., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS '03).
Rao, A., Lakshminarayanan K., Surana S., Karp R. M., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Second International Workshop on Peer-to-Peer Systems.
Ranganath, C., Shastri L., & D'Esposito M. (2002).  A New View of the Medial Temporal Lobes and the Structure of Memory.
Randall, D., & Sinclair A. (1993).  Testable Algorithms for Self-Avoiding Walks.
Randall, D. (1994).  Counting in Lattices: Combinatorial Problems from Statistical Mechanics.
Raman, S., McCanne S., & Shenker S. (1998).  Asymptotic Behavior of Global Recovery in SRM. Proceedings of the 1998 ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems. 90-99.
Ramakrishnan, K.. K., Floyd S., & Black D.. (2001).  RFC 3168: The Addition of Explicit Congestion Notification (ECN) to IP.

Pages