Publications

Found 4258 results
Author Title [ Type(Asc)] Year
Technical Report
Hastad, J.., Impagliazzo R., Levin L. A., & Luby M. (1991).  Construction of a Pseudo-Random Generator from Any One-Way Function.
Scheler, G. (1997).  Constructing Semantic Representations Using the MDL Principle.
Berthold, M. R., & Huber K-P.. (1997).  Constructing Fuzzy Graphs from Examples.
Weaver, N., & Allman M. (2009).  On Constructing a Trusted Path to the User.
Brewka, G., Guesgen H. Werner, & Hertzberg J. (1992).  Constraint Relaxation and Nonmonotonic Reasoning.
Ladkin, P. (1990).  Constraint Reasoning With Intervals: A Tutorial, Survey and Bibliography.
Kannan, J. Kumar, Caesar M., Stoica I., & Shenker S. J. (2007).  On the Consistency of DHT-Based Routing.
Morgan, N. (1990).  Considerations for the Electronic Implementation of Artificial Neural Networks.
Hölldobler, S. (1990).  A Connectionist Unification Algorithm.
Renals, S., Morgan N., Bourlard H., Cohen M., Franco H., Wooters C., et al. (1991).  Connectionist Speech Recognition: Status and Prospects.
Renals, S., & Morgan N. (1992).  Connectionist Probability Estimation in HMM Speech Recognition.
Feldman, J. (1985).  Connectionist Models and Parallelism in High Level Vision.
Stolcke, A. (1989).  A Connectionist Model of Unification.
Kohn, P. (1991).  Connectionist Layered Object-Oriented Network Simulator (CLONES): User's Manual.
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.
Guesgen, H. Werner (1990).  A Connectionist Approach to Symbolic Constraint Satisfaction.
Munro, P. W. (1989).  Conjectures on Representations in Backpropagation Networks.
Kobsa, A. (1989).  Conceptual Hierarchies in Classical and Connectionist Architecture.
Feldman, J., & Ballard D. Harry (1981).  Computing with Connections.
Omrani, A.., & M. Shokrollahi A. (1996).  Computing Irreducible Representations of Supersolvable Groups over Small Finite Fields.
Feldman, J., Paul R. P., & Falk G. (1969).  The Computer Description of Simply Described Scenes.
Amengual, A. (2009).  A computational model of attachment secure responses in the Strange Situation.
Kramer, O. (2010).  Computational Intelligence and Sustainable Energy: Case Studies and Applications.
Ehrenfeucht, A., & Karpinski M. (1990).  The Computational Complexity of (XOR, AND)-Counting Problems.

Pages