Publications

Found 814 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is B  [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 
C
Zhang, Y., Breslau L., Paxson V., & Shenker S. J. (2002).  On the Characteristics and Origins of Internet Flow Rates. ACM SIGCOMM Computer Communication Review. 32(4), 309-322.
Zhang, Y., Breslau L., Paxson V., & Shenker S. J. (2002).  On the Characteristics and Origins of Internet Flow Rates. Proceedings of the ACM SIGCOMM Conference. 309-322.
Pang, R., Yegneswaran V., Barford P., Paxson V., & Peterson L. (2004).  Characteristics of Internet Background Radiation. Proceedings of the 2004 Internet Measurement Conference (IMC 2004).
Ar, S., Blum M. E., Codenotti B., & Gemmell P. (1992).  Checking Approximate Computations Over the Reals.
Bracci, P. M., Skibola C. F., Conde L., Halperin E., Lightfoot T., Smith A., et al. (2010).  Chemokine Polymorphisms and Lymphoma: A Pooled Analysis. Leukemia and Lymphoma. 51(3), 497-506.
Bachrach, J., Vo H., Richards B., Lee Y., Waterman A., Avižienis R., et al. (2012).  Chisel: Constructing Hardware in a Scala Embedded Language.
McGillivary, A.., Fornasa M., Baglietto P., Stecca M., Caprino G., & Maresca M. (2014).  Cloud Computing Goes To Sea: Ship Design Around Software Defined Networking (SDN) Systems. Ocean News and Technology.
Asanović, K., Beck J., Callahan T. J., Feldman J., Irissou B., Kingsbury B., et al. (1993).  CNS-1 Architecture Specification: A Connectionist Network Supercomputer.
Ruppenhofer, J., Baker C. F., & Fillmore C. J. (2002).  Collocational Information in the FrameNet Database. Proceedings of the Tenth Euralex International Congress. 359-369.
Barker, J., Cooke M. P., & Ellis D. P. W. (2001).  Combining Bottom-Up and Top-Down Constraints for Robust ASR: The Multiscore Decoder. Proceedings of the Workshop on Consistent and Reliable Acoustic Cues (CRAC-2001).
Demers, A. J., Weiser M., Hayes B., Boehm H-J.., Bobrow D., & Shenker S. J. (1990).  Combining Generational and Conservative Garbage Collection: Framework and Implementations. Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). 261-269.
Demers, A. J., Weiser M., Hayes B., Boehm H-J.., Bobrow D., & Shenker S. J. (1990).  Combining Generational and Conservative Garbage Collection: Framework and Implementations. Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). 261-269.
Boulis, C., & Ostendorf M. (2004).  Combining Multiple Clustering Systems. Proceedings of the 15th European Conference on Machine Learning (ECML/PKDD 2004).
Müller, C., & Burkhardt F.. (2007).  Combining Short-term Cepstral and Long-term Pitch Features for Automatic Recognition of Speaker Age. 2277-2280.
Breslau, L., Jamin S., & Shenker S. J. (2000).  Comments on the Performance of Measurement-Based Admission Control Algorithms.
Breslau, L., Jamin S., & Shenker S. J. (2000).  Comments on the Performance of Measurement-Based Admission Control Algorithms. Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000). 3, 1233-1242.
Beigel, R. (1992).  Communicating with Low-Diffraction Lasers and Mirrors.
Böcking, S. (1995).  Communication Performance Models.
Gao, Y., Beijbom O., Zhang N., & Darrell T. (2016).  Compact Bilinear Pooling. The IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 317-326.
Medina, A., Taft N., Salamatian K., Bhattacharyya S., & Diot C. (2002).  Comparative Analysis of Traffic Matrix Estimation Methods.
Hermansky, H., Bayya A., Morgan N., & Kohn P. (1991).  Compensation for the effect of the communication channel in Perceptual Linear Predictive (PLP) analysis of speech. Proceedings of the Second European Conference on Speech Communication and Technology (Eurospeech '91). 1367-1370.
Blum, L., Cucker F., Shub M., & Smale S. (1995).  Complexity and Real Computation: A Manifesto.
Blum, M. E., Karp R. M., Vornberger O.., Papadimitriou C. H., & Yannakakis M.. (1981).  The Complexity of Testing Whether a Graph is a Superconcentrator. 13(4-5), 164-167.
Berman, P., Karpinski M., Larmore L. L., Plandowski W., & Rytter W. (1996).  The Complexity of Two-Dimensional Compressed Pattern Matching.
Beame, P., Karp R. M., Pitassi T., & Saks M. (1998).  On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.

Pages