Publications

Found 1886 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is S  [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
Santos, E. E. (1994).  Complexity Issues for Solving Triangular Linear Systems in Parallel.
Gramm, J., Nierhoff T., Sharan R., & Tantau T. (2004).  On the Complexity of Haplotyping via Perfect Phylogeny. Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. 35-46.
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.
Schryen, G. (2009).  A Comprehensive and Comparative Analysis of the Patching Behavior of Open Source and Closed Source Software Vendors. 153-168.
Egecioglu, O.., Smith T.. R., & Moody J. (1987).  Computable Functions and Complexity in Neural Networks.
M. Shokrollahi, A. (1996).  Computation of Irregular Primes up to Eight Million (Preliminary Report).
Grigoriev, D. Yu., Karpinski M., & Singer M. F. (1991).  Computational Complexity of Sparse Rational Interpolation.
Shastri, L. (2001).  A computational model of episodic memory formation in the hippocampal system. 38-40, 889-897.
Shastri, L. (1993).  A Computational Model of Tractable Reasoning -- Taking Inspiration from Cognition. Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 93). 202-207.
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.
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.
Omrani, A.., & M. Shokrollahi A. (1996).  Computing Irreducible Representations of Supersolvable Groups over Small Finite Fields.
Paxson, V., Allman M., Chu J., & Sargent M. (2011).  Computing TCP's Retransmission Timer.
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.
Feldman, J., & Shastri L. (2003).  Connectionism.
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. (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.
Wendelken, C., & Shastri L. (2004).  Connectionist Mechanisms for Cognitive Control.
Garagnani, M., Shastri L., & Wendelken C. (2001).  A Connectionist Model of Planning via Back-Chaining Search. Proceedings of the 20th Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2001).
Garagnani, M., Shastri L., & Wendelken C. (2002).  A Connectionist Model of Planning via Back-Chaining Search. Proceedings of the 24th Annual Conference of the Cognitive Science Society (CogSci 2002).
Stolcke, A. (1989).  A Connectionist Model of Unification.
[Anonymous] (1999).  Connectionist Symbol Processing: Dead or Alive?. (Jagota, A.., Plate T.., Shastri L., & Sun R.., Ed.).2, 1-40.

Pages