Publications

Found 319 results
[ Author(Asc)] 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
Byers, J. W., Luby M., Mitzenmacher M., & Rege A. (1998).  Digital Fountain Approach to Reliable Distribution of Bulk Data.
Byers, J. W. (1998).  Maximizing Throughput of Reliable Bulk Network Transmissions.
Byers, J. W., Luby M., Mitzenmacher M., & Rege A. (1998).  A Digital Fountain Approach to Reliable Distribution of Bulk Data.
Byers, J. W., Luby M., & Mitzenmacher M. (2019).  A digital fountain retrospective. ACM SIGCOMM Computer Communication Review. 49(5), 82-85.
Buttyan, L.., Dora L.., Felegyhazi M., & Vajda I.. (2010).  Barter Trade Improves Message Delivery in Opportunistic Networks. Ad Hoc Networks. 8(1), 1-14.
Burglar, C.., Omohundro S., Covell M., Slaney M., Ahmad S., Forsyth D. A., et al. (1997).  Probabilistic Models of Verbal and Body Gestures.
Bürgisser, P., Lickteig T. Michael, & Shub M. (1991).  Test Complexity of Generic Poynomials.
Bürgisser, P., Karpinski M., & Lickteig T. Michael (1992).  On Randomized Algebraic Test Complexity.
Bürgisser, P., Karpinski M., & Lickteig T. Michael (1991).  Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.
Bürgisser, P., & Lickteig T. Michael (1991).  Verification Complexity of Linear Prime Ideals.
Bulyko, I., Ostendorf M., & Stolcke A. (2003).  Getting more mileage from web text sources for conversational speech language modeling using class-dependent mixtures. Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL 2003). 2, 7-9.
Buller, A. (1995).  Fuzzy Inferencing: A Novel, Massively Parallel Approach.
Buller, A. (1995).  Operations on Multimodal Records: Towards a Computational Cognitive Linguistics.
Buchholz, S., Göbel S., Schill A., & Ziegert T. (2001).  Dissemination of Mutable Sets of Web Objects.
Bshouty, N. H., Hancock T. R., Hellerstein L., & Karpinski M. (1993).  An Algorithm to Learn Read-Once Threshold Formulas, and Some Generic Transformations Between Learning Models (Revised Version).
Bshouty, N. H., Hancock T. R., Hellerstein L., & Karpinski M. (1992).  Read-Once Threshold Formulas, Justifying Assignments, and Generic Tranformations.
Bryant, J. (2004).  Recovering Coherent Interpretations Using Semantic Integration of Partial Parses.
Bryant, J. (2004).  Scalable Construction Based Parsing and Semantic Analysis. Proceedings of Second Workshop on Scalable Natural Language Understanding.
Bryant, J., Chang N., Porzel R., & Sanders K. (2001).  Where is natural language understanding? Toward context-dependent utterance interpretation. Proceedings of the 7th Annual Conference on Architectures and Mechanisms for Language Processing AMLaP.
Bryant, J. (2004).  Scalable Construction-Based Parsing and Semantic Analysis. Proceedings of the Second International Workshop on Scalable Natural Language Understanding (ScaNaLU 2004). 33-40.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Torque: Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. Nucleic Acids Research. 37, 106-108.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. 74-89.
Brockmann, K., & Wanka R. (1996).  Efficient Oblivious Parallel Sorting on the MasPar MP-1.

Pages