Publications

Found 4258 results
Author [ Title(Asc)] Type Year
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
Shastri, L., Grannes D. Jeffrey, Narayanan S., & Feldman J. (1999).  A Connectionist Encoding of Parameterized Schemas and Reactive Plans. Proceedings of the First SMART-Symposium. 1-28.
Shastri, L., Grannes D. Jeffrey, Narayanan S., & Feldman J. (2002).  A Connectionist Encoding of Parameterized Schemas and Reactive Plans.
Shastri, L., Grannes D. Jeffrey, Narayanan S., & Feldman J. (2002).  A Connectionist Encoding of Parameterized Schemas and Reactive Plans.
Shastri, L., Grannes D. Jeffrey, Narayanan S., & Feldman J. (2002).  A Connectionist Encoding of Parameterized Schemas and Reactive Plans.
Bourlard, H., & Morgan N. (1991).  Connectionist Approaches to the Use of Markov Models for Continuous Speech Recognition. III, 213-219.
Guesgen, H. Werner (1990).  A Connectionist Approach to Symbolic Constraint Satisfaction.
Feldman, J., & Shastri L. (2003).  Connectionism.
Krause, M., Hall M., Williams J. Jay, Paritosh P., Prip J., & Caton S. (2016).  Connecting Online Work and Online Education at Scale. Proceedings of the 2016 CHI Conference Extended Abstracts on Human Factors in Computing Systems. 3536-3541.
Munro, P. W. (1989).  Conjectures on Representations in Backpropagation Networks.
Liu, D., Allman M., Jin S., & Wang L. (2007).  Congestion Control Without a Startup Phase.
Floyd, S. (2000).  Congestion Control Principles.
Lefelhocz, C., Lyles B., Shenker S. J., & Zhang L. (1996).  Congestion Control for Best Effort Service: Why We Need a New Paradigm. IEEE Network Magazine. 10(1), 10-19.
Tsai, T.. J., & Janin A. (2013).  Confidence-Based Scoring: A Useful Diagnostic Tool for Detection Tasks.
Kobsa, A. (1989).  Conceptual Hierarchies in Classical and Connectionist Architecture.
Feldman, J., Fanty M. A., & Goddard N. H. (1988).  Computing with Structured Neural Networks. IEEE Computer. 21(3), 91-103.
Feldman, J. (1990).  Computing with Structured Connectionist Networks. 434-454.
Feldman, J., Fanty M. A., Goddard N. H., & Lynne K.. J. (1988).  Computing with Structured Connectionist Networks. Communications of the ACM. 31(2), 170-187.
Feldman, J., & Ballard D. Harry (1982).  Computing with Connections.
Feldman, J., & Ballard D. Harry (1981).  Computing with Connections.
Alber, J., Gramm J., Guo J., & Niedermeier R. (2004).  Computing the Similarity of Two Sequences with Nested Arc Annotations. Theoretical Computer Science. 312(2-3), 337-358.
Paxson, V., & Allman M. (2000).  Computing TCP's Retransmission Timer.
Paxson, V., Allman M., Chu J., & Sargent M. (2011).  Computing TCP's Retransmission Timer.
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.
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.
Gairing, M., Lücking T., Mavronicolas M., & Monien B. (2010).  Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory of Computing Systems. 47(2), 405-432.

Pages