Advanced Search
DSpace@MIT

Browsing AI Memos (1959 - 2004) by Title

Research and Teaching Output of the MIT Community

Browsing AI Memos (1959 - 2004) by Title

Sort by: Order: Results:

  • Paradigms for Structure in an Amorphous Computer 
    Coore, Daniel; Nagpal, Radhika; Weiss, Ron (1997-10-01)
    Recent developments in microfabrication and nanotechnology will enable the inexpensive manufacturing of massive numbers of tiny computing elements with sensors and actuators. New programming paradigms are required for ...
  • Parallel Algorithms for Computer Vision on the Connection Machine 
    Little, James J. (1986-11-01)
    The Connection Machine is a fine-grained parallel computer having up to 64K processors. It supports both local communication among the processors, which are situated in a two-dimensional mesh, and high-bandwidth ...
  • Parallel and Deterministic Algorithms for MRFs: Surface Reconstruction and Integration 
    Geiger, Davi; Girosi, Federico (1989-05-01)
    In recent years many researchers have investigated the use of Markov random fields (MRFs) for computer vision. The computational complexity of the implementation has been a drawback of MRFs. In this paper we derive ...
  • Parallel Computation of Vernier Offsets, Curvature and Chevrons in Humans 
    Fahle, Manfred (1989-12-01)
    A vernier offset is detected at once among straight lines, and reaction times are almost independent of the number of simultaneously presented stimuli (distractors), indicating parallel processing of vernier offsets. ...
  • Parallel Function Application on a DNA Substrate 
    Blumberg, Andrew Justin (1996-12-01)
    In this paper I present a new model that employs a biological (specifically DNA -based) substrate for performing computation. Specifically, I describe strategies for performing parallel function application in the ...
  • Parallel Networks for Machine Vision 
    Horn, Berthold K.P. (1988-12-01)
    The amount of computation required to solve many early vision problems is prodigious, and so it has long been thought that systems that operate in a reasonable amount of time will only become feasible when parallel ...
  • Parallel Simulation of Subsonic Fluid Dynamics on a Cluster of Workstations 
    Skordos, Panayotis A. (1995-12-01)
    An effective approach of simulating fluid dynamics on a cluster of non- dedicated workstations is presented. The approach uses local interaction algorithms, small communication capacity, and automatic migration of parallel ...
  • Parallel Solutions to Geometric Problems on the Scan Model of Computation 
    Blelloch, Guy E.; Little, James J. (1988-02-01)
    This paper describes several parallel algorithms that solve geometric problems. The algorithms are based on a vector model of computation---the scan-model. The purpose of this paper is both to show how the model can ...
  • Parsing and Generating English Using Commutative Transformations 
    Katz, Boris; Winston, Patrick H. (1982-05-01)
    This paper is about an implemented natural language interface that translates from English into semantic net relations and from semantic net relations back into English. The parser and companion generator were implemented ...
  • Parsing and Linguistic Explanation 
    Berwick, Robert C.; Weinberg, Amy S. (1985-04-01)
    This article summarizes and extends recent results linking deterministic parsing to observed "locality principles" in syntax. It also argues that grammatical theories based on explicit phrase structure rules are unlikely ...
  • Parsing Intensity Profiles 
    Lozano-Perez, Tomas (1975-05-01)
    Much low-level vision work in AI deals with one-dimensional intensity profiles. This paper describes PROPAR, a system that allows a convenient and uniform mechanism for recognizin such profiles. PROPAR is a modified ...
  • Parsing Key Word Grammars 
    Martin, William (1969-03-01)
    Key word grammars are defined to be the same as context free grammars, except that a production may specify a string of arbitrary symbols. These grammars define languages similar to those used in the programs CARPS and ...
  • Parsing Protocols Using Problem Solving Grammars 
    Miller, Mark L.; Goldstein, Ira P. (1976-12-01)
    A theory of the planning and debugging of programs is formalized as is context free grammar. The grammar is used to reveal the constituent structure of problem solving episodes, by parsing protocols in which programs ...
  • Partial Evaluation for Scientific Computing: The Supercomputer Toolkit Experience 
    Berlin, Andrew; Surati, Rajeev (1994-05-01)
    We describe the key role played by partial evaluation in the Supercomputer Toolkit, a parallel computing system for scientific applications that effectively exploits the vast amount of parallelism exposed by partial ...
  • Parts of Recognition 
    Hoffman, D.D.; Richards, Whitman (1983-12-01)
    A complete theory of object recognition is an impossibility ??t simply because of the multiplicity of visual cues we exploit in elegant coordination to identify an object, but primarily because recognition involves ...
  • Passive Navigation 
    Bruss, Anna R.; Horn, Berthold K.P. (1981-11-01)
    A method is proposed for determining the motion of a body relative to a fixed environment using the changing image seen by a camera attached to the body. The optical flow in the image plane is the input, while the ...
  • Paterson's Worm 
    Beeler, Michael (1973-06-01)
    A description of a mathematical idealization of the feeding pattern of a kind of worm is given.
  • Pattern-Directed Invocation with Changing Equations 
    Feldman, Yishai A.; Rich, Charles (1988-05-01)
    The interaction of pattern-directed invocation with equality in an automated reasoning system gives rise to a completeness problem. In such systems, a demon needs to be invoked not only when its pattern exactly matches ...
  • Pattern Motion Perception: Feature Tracking or Integration of Component Motions? 
    Sinha, Pawan (1994-10-01)
    A key question regarding primate visual motion perception is whether the motion of 2D patterns is recovered by tracking distinctive localizable features [Lorenceau and Gorea, 1989; Rubin and Hochstein, 1992] or by ...
  • PAZATN: A Linguistic Approach to Automatic Analysis of Elementary Programming Protocols 
    Miller, Mark L.; Goldstein, Ira P. (1976-12-01)
    PATN is a design for a machine problem solver which uses an augmented transition network (ATN) to represent planning knowledge. In order to explore PATN's potential as a theory of human problem solving, a linguistic ...
MIT-Mirage