Publications

Found 323 results
[ Author(Desc)] Title 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 
B
Bilmes, J. A., Morgan N., Wu S-L., & Bourlard H. (1996).  Stochastic Perceptual Speech Models with Durational Dependence. Proceedings of the Fourth International Conference on Spoken Language Processing (CSLP-96).
Bilmes, J. A. (1999).  Buried Markov Models for Speech Recognition. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1999).
Binder, W.., & Roth V. (2002).  Secure Mobile Agent Systems Using Java - Where Are We Heading?. Proceedings, 17th ACM Symposium on Applied Computing, Special Track on Agents, Interactions, Mobility, and Systems (SAC/AIMS).
Bini, D., & Pan V. (1992).  Improved Parallel Computations with Toeplitz-like and Hankel-like Matrices.
Bini, D., & Pan V. (1992).  Improved Parallel Polynomial Division and Its Extensions.
Bird, S. (2018).  Designing Mobile Applications for Endangered Languages. The Oxford Handbook of Endangered Languages.
Black, A. W., H. Bunnell T., Dou Y., Kumar P., Metze F., Perry D., et al. (2012).  Articulatory Features for Expressive Speech Synthesis.
Blanton, E., & Allman M. (2005).  On the Impact of Bursting on TCP Performance. Proceedings of the Sixth Passive and Active Measurement Workshop (PAM 2005).
Blanton, E., Allman M., Fall K., & Wang L. (2003).  A Conservative Selective Acknowledgment (SACK)-Based Loss Recovery Algorithm for TCP.
Blanton, E., & Allman M. (2002).  On Making TCP More Robust to Packet Reordering.
Blanton, J., Blanton E., & Allman M. (2008).  Using Spurious Retransmissions to Adapt the Retransmission Timeout.
Blanton, E., & Allman M. (2004).  RFC 3708: Using TCP DSACKs and SCTP Duplicate TSNs to Detect Spurious Retransmissions.
Blasig, R., & Fahner G. (1996).  On the Representative Power of Commented Markov Models.
Blelloch, G. E., Dhamdhere K., Halperin E., Ravi RR., Schwartz R., & Sridhar S. (2006).  Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP 2006). 667-678.
Blömer, J., Kalfane M., Karpinski M., Karp R. M., Luby M., & Zuckerman D. (1995).  An XOR-Based Erasure-Resilient Coding Scheme.
Blömer, J., Karp R. M., & Welzl E. (1997).  The Rank of Sparse Random Matrices Over Finite Fields. Random Structures and Algorithms. 10,
Blömer, J., Karp R. M., & Welzl E. (1996).  The Rank of Sparse Random Matrices Over Finite Fields.
Blum, M. E. (1988).  Designing Programs to Check Their Work.
Blum, L. (1990).  The Goedel Incompleteness Theorem and Decidability over a Ring.
Blum, L. (1989).  Lectures on a Theory of Computation and Complexity over the Reals.
Blum, L. (1991).  A Brief History of the Association for Women in Mathematics: The Presidents' Perspectives.
Blum, L., Cucker F., Shub M., & Smale S. (1996).  Algebraic Settings for the Problem.
Blum, M. E., & Kannan S. (1988).  Program Correctness Checking and the Design of Programs That Check Their Work.
Blum, M. E., & Wasserman H. (1994).  Software Reliability via Run-Time Result-Checking.
Blum, L., Cucker F., Shub M., & Smale S. (1995).  Complexity and Real Computation: A Manifesto.

Pages