Publications

Found 823 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
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.
Ben-David, Y., Hasan S., Pal J., Vallentin M., Panjwani S.., Gutheim P.., et al. (2011).  Computing Security in the Developing World: A Case for Multidisciplinary Research. 39-44.
Ben-David, Y., Hasan S., Pal J., Vallentin M., Panjwani S.., Gutheim P.., et al. (2011).  Computing Security in the Developing World: A Case for Multidisciplinary Research. 39-44.
Baswana, S., Biswas S., Doerr B., Friedrich T., Kurur P., & Neumann F. (2009).  Computing Single Source Shortest Paths Using Single-Objective Fitness Functions. 59-66.
Baswana, S., Biswas S., Doerr B., Friedrich T., Kurur P., & Neumann F. (2009).  Computing Single Source Shortest Paths Using Single-Objective Fitness Functions. 59-66.
Feldman, J., & Ballard D. Harry (1982).  Computing with Connections.
Feldman, J., & Ballard D. Harry (1981).  Computing with Connections.
Bourlard, H., & Morgan N. (1991).  Connectionist Approaches to the Use of Markov Models for Continuous Speech Recognition. III, 213-219.
Feldman, J., McClelland J.. L., Bower G.., & McDermott D.. (1986).  Connectionist Models and Cognitive Science: Goals, Directions and Implications.
Feldman, J., & Ballard D. Harry (1982).  Connectionist Models and Their Properties. 6, 205-254.
Renals, S., Morgan N., Bourlard H., Cohen M., & Franco H. (1991).  Connectionist Optimisation of Tied Mixture Hidden Markov Models. IV, 167-174.
Renals, S., Morgan N., Cohen M., Bourlard H., & Franco H. (1992).  Connectionist Probability Estimation in the Decipher Speech Recognition System. Proceedings of the IEEE International Conference on Acoustics, Speech & Signal Processing (ICASSP 1992). I601-I604.
Renals, S., Morgan N., Bourlard H., Cohen M., & Franco H. (1993).  Connectionist Probability Estimators in HMM Speech Recognition. IEEE Transactions on Speech and Audio Processing.
Bourlard, H., & Morgan N. (1993).  Connectionist Speech Recognition: A Hybrid Approach.
Renals, S., Morgan N., Bourlard H., Cohen M., Franco H., Wooters C., et al. (1991).  Connectionist Speech Recognition: Status and Prospects.
Bourlard, H., & Morgan N. (1998).  Connectionist Techniques for Speech Recognition. 356-361.
Blanton, E., Allman M., Fall K., & Wang L. (2003).  A Conservative Selective Acknowledgment (SACK)-Based Loss Recovery Algorithm for TCP.
Brewka, G., Guesgen H. Werner, & Hertzberg J. (1992).  Constraint Relaxation and Nonmonotonic Reasoning.
Berthold, M. R., & Huber K-P.. (1997).  Constructing Fuzzy Graphs from Examples.
Frik, A., Bernd J., & Alomar N. (2019).  The Contextual Preferences of Older Adults on Information Sharing. Proceeding of the 2nd annual Symposium on Applications of Contextual Integrity.
Wijesekera, P., Reardon J., Reyes I., Tsai L., Chen J-W., Good N., et al. (2018).  Contextualizing Privacy Decisions for Better Prediction (and Protection). Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI ’18).
Bourlard, H., & Morgan N. (1993).  Continuous Speech Recognition by Connectionist Statistical Methods. IEEE Transactions on Neural Networks. 4(6), 893-909.

Pages