Publications
Found 823 results
Author [ Title] Type Year Filters: First Letter Of Last Name is B [Clear All Filters]
(1995).
The Complexity of Testing Whether a Graph is a Superconcentrator.
13(4-5), 164-167.
(1981).
(1996). On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas.
Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
(1998).
(2011).
(2011).
(2009).
(2009).
(1982).
(1981). Connectionist Approaches to the Use of Markov Models for Continuous Speech Recognition.
III, 213-219.
(1991).
(1986). Connectionist Models and Their Properties.
6, 205-254.
(1982).
(1991). Connectionist Probability Estimation in the Decipher Speech Recognition System.
Proceedings of the IEEE International Conference on Acoustics, Speech & Signal Processing (ICASSP 1992). I601-I604.
(1992). Connectionist Probability Estimators in HMM Speech Recognition.
IEEE Transactions on Speech and Audio Processing.
(1993).
(1993).
(1991).
(1998).
(2003).
(1992).
(1997). The Contextual Preferences of Older Adults on Information Sharing.
Proceeding of the 2nd annual Symposium on Applications of Contextual Integrity.
(2019). Contextualizing Privacy Decisions for Better Prediction (and Protection).
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI ’18).
(2018). Continuous Speech Recognition by Connectionist Statistical Methods.
IEEE Transactions on Neural Networks. 4(6), 893-909.
(1993).