Found 4169 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 
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S., & Singla A. (2012).  Brief Announcement: On the Resilience of Routing Tables. 237-238.
Ramabhadran, S., Ratnasamy S., Hellerstein J. M., & Shenker S. (2004).  Brief Announcement: Prefix Hash Tree. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004). 367.
Whitlock, S., Scott C., & Shenker S. (2013).  Brief Announcement: Techniques for Programmatically Troubleshooting Distributed Systems. 1-3.
Allman, M., Paxson V., & Terrell J.. (2007).  A Brief History of Scanning. 77-82.
Blum, L. (1991).  A Brief History of the Association for Women in Mathematics: The Presidents' Perspectives.
Pal, J., & Fonseca R. (2003).  Bringing Devices to the Masses: A Comparative Study of the Brazilian Computador Popular and the Indian Simputer.
Medina, A., & Matta I. (2000).  BRITE: A Flexible Generator of Internet Topologies.
Medina, A., Lakhina A., Matta I., & Byers J. W. (2001).  BRITE: An Approach to Universal Topology Generation. Proceedings of MASCOTS 2001.
Medina, A., Lakhina A., Matta I., & Byers J. W. (2001).  BRITE: Universal Topology Generation From a User's Perspective.
Paxson, V. (1999).  Bro: A System for Detecting Network Intruders in Real-Time. 2435-2463.
Paxson, V. (1998).  Bro: A System for Detecting Network Intruders in Real-Time. Proceedings of the 7th USENIX Security Symposium.
Lei, H., & Mirghafori N. (2014).  Broad Phonetic Classes for Speaker Verification with Noisy, Large-Scale Data.
Schindelhauer, C. (2000).  Broadcasting Time Cannot be Approximated Within a Factor of 57/56-epsilon.
Kreibich, C. (2005).  Brooery: A Graphical Environment for Analysis of Security-Relevant Network Activity. Proceedings of the USENIX Annual Technical Conference, FREENIX Track (USENIX '05 FREENIX). 109-118.
Bell, O., Allman M., & Kuperman B. (2012).  On Browser-Level Event Logging.
Ferrari, D., & Verma D. C. (1990).  Buffer Space Allocation for Real-Time Channels in a Packet-Switching Network.
Ren, J., Lindorfer M., Dubois D. J., Rao A., Choffnes D., & Vallina-Rodriguez N. (2018).  Bug Fixes, Improvements, ... and Privacy Leaks - A Longitudinal Study of PII Leaks Across Android App Versions. NDSS 2018.
Hwang, M-Y., Peng G.., Wang W., Faria A., & Heidel A.. (2007).  Building a Highly Accurate Mandarin Speech Recognizer. 490-495.
Fillmore, C. J., Wooters C., & Baker C. F. (2001).  Building a Large Lexical Databank Which Provides Deep Semantics. Proceedings of the Pacific Asian Conference on Language, Information and Computation (PACLIC).
Kornexl, S.., Paxson V., Dreger H., Feldmann A., & Sommer R. (2005).  Building a Time Machine for Efficient Recording and Retrieval of High-Volume Network Traffic. Proceedings of the Fifth ACM Conference on Internet Measurement (IMC 2005). 267-272.
Pellegrini, M. (1993).  Building Convex Space Partitions Induced by Pairwise Interior-Disjoint Simplices.
Heidemann, J., Silva F., Intanagonwiwat C., Govindan R., Estrin D., & Ganesan D. (2001).  Building Efficient Wireless Sensor Networks With Low-Level Naming. Proceedings of the Symposium on Operating Systems Principles.
Popa, L., Egi N.., Ratnasamy S., & Stoica I. (2010).  Building Extensible Networks with Rule-Based Forwarding. 379-391.
Shue, C., Kalafut A., Allman M., & Taylor C. (2012).  On Building Inexpensive Network Capabilities. ACM SIGCOMM Computer Communication Review. 42(2), 72-79.
Batten, C., Joshi A., Orcutt J., Khilo A., Moss B., Holzwarth C., et al. (2009).  Building Many-Core Processor-to-DRAM Networks with Monolithic CMOS Silicon Photonics. IEEE Micro. 29(4), 8-21.