Publications

Found 4258 results
Author [ Title(Desc)] 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
Lönneker-Rodman, B., & Narayanan S. (2010).  Computational Models of Figurative Language.
Kimmel, G., Sharan R., & Shamir R. (2004).  Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification and Population Stratification. INFORMS Journal on Computing.
Shastri, L. (2002).  A Computationally Efficient Abstraction of Long-term Potentiation. Neurocomputing. 44-46, 33-41.
Hung, H., Friedland G., & Yeo C. (2010).  Computationally Efficient Clustering of Audio-Visual Meeting Data. 25-59.
Feldman, J., Paul R. P., & Falk G. (1969).  The Computer Description of Simply Described Scenes.
Feldman, J., Paul R. P., & Falk G. (1969).  The Computer Description of Simply Described Scenes.
Friedland, G. (2007).  Computers and Commerce: A Study of Technology and Management at Eckert-Mauchly Computer Company, Engineering Research Associates, and Remington Rand, 1946-1957 (book review). IEEE Annals of the History of Computing. 29(2), 74-77.
Omrani, A.., & M. Shokrollahi A. (1996).  Computing Irreducible Representations of Supersolvable Groups over Small Finite Fields.
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.
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.
Paxson, V., Allman M., Chu J., & Sargent M. (2011).  Computing TCP's Retransmission Timer.
Paxson, V., & Allman M. (2000).  Computing TCP's Retransmission Timer.
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.
Feldman, J., & Ballard D. Harry (1982).  Computing with Connections.
Feldman, J., & Ballard D. Harry (1981).  Computing with Connections.
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., Fanty M. A., & Goddard N. H. (1988).  Computing with Structured Neural Networks. IEEE Computer. 21(3), 91-103.
Kobsa, A. (1989).  Conceptual Hierarchies in Classical and Connectionist Architecture.
Tsai, T.. J., & Janin A. (2013).  Confidence-Based Scoring: A Useful Diagnostic Tool for Detection Tasks.
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.
Floyd, S. (2000).  Congestion Control Principles.
Liu, D., Allman M., Jin S., & Wang L. (2007).  Congestion Control Without a Startup Phase.
Munro, P. W. (1989).  Conjectures on Representations in Backpropagation Networks.

Pages