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:

  • A Heterarchical Program for Recognition of Polyhedra 
    Shirai, Yoshiaki (1972-06-01)
    Recognition of polyhedra by a heterarchical program is presented. The program is based on the strategy of recognizing objects step by step, at each time making use of the previous results. At each stage, the most obvious ...
  • A Heuristic Program that Constructs Decision Trees 
    Winston, Patrick (1969-03-01)
    Suppose there is a set of objects, {A, B,...E} and a set of tests, {T1, T2,...TN). When a test is applied to an object, the result is wither T or F. Assume the test may vary in cost and the object may vary in probability ...
  • A Heuristic Program to Solve Geometric Analogy Problems 
    Evans, T.G. (1962-10-01)
    A program to solve a wide class of intelligence-test problems of the "geometric-analogy" type ("figure A is to figure B as figure C is to which of the following figures?") is being constructed. The program, which is written ...
  • Heuristic Techniques in Computer Aided Circuit Analysis 
    Sussman, Gerald Jay; Stallman, Richard Matthew (1975-03-01)
    We present EL, a new kind of circuit analysis program. Whereas other circuit analysis systems rely on classical, formal analysis techniques, EL employs heuristic "inspection" methods to solve rather complex DC bias ...
  • Hidden Clues in Random Line Stereograms 
    Nishihara, H.K.; Poggio, T. (1983-08-01)
    Successful fusion of random-line stereograms with breaks in the vernier acuity range has been previously interpreted to suggest that the interpolation process underlying hyperacuity is parallel and preliminary to ...
  • Hierarchical Mixtures of Experts and the EM Algorithm 
    Jordan, Michael I.; Jacobs, Robert A. (1993-08-01)
    We present a tree-structured architecture for supervised learning. The statistical model underlying the architecture is a hierarchical mixture model in which both the mixture coefficients and the mixture components are ...
  • Holes 
    Winston, Patrick H. (1968-08-01)
    This memo originally had two parts. The first dealt with certain deficiencies in an early version of Guzman's program, SEE. The problems have been fixed, and the corresponding discussion has been dropped from this ...
  • How are Three-Deminsional Objects Represented in the Brain? 
    Buelthoff, Heinrich H.; Edelman, Shimon Y.; Tarr, Michael J. (1994-04-01)
    We discuss a variety of object recognition experiments in which human subjects were presented with realistically rendered images of computer-generated three-dimensional objects, with tight control over stimulus shape, ...
  • How do Humans Determine Reflectance Properties under Unknown Illumination? 
    Fleming, Roland W.; Dror, Ron O.; Adelson, Edward H. (2001-10-21)
    Under normal viewing conditions, humans find it easy to distinguish between objects made out of different materials such as plastic, metal, or paper. Untextured materials such as these have different surface reflectance ...
  • How Near is Near? 
    Danofsky, Murray Elias (1976-02-01)
    This paper presents a system for understanding the concept of near and far, weighing such factors as purpose of the judgement, dimensions of the objects, absolute size of the distance, and size of the distance relative ...
  • How People Re-find Information When the Web Changes 
    Teevan, Jaime (2004-06-18)
    This paper investigates how people return to information in a dynamic information environment. For example, a person might want to return to Web content via a link encountered earlier on a Web page, only to learn that the ...
  • How the GAS Program Works with a Note on Simulating Turtles with Touch Sensors 
    Speciner, Michael (1972-12-01)
    The GAS program is a display simulation of a 2 dimensional ideal gas. Barriers, or walls, are line segments, and molecules, alias particles or balls, are circles. Collisions occur between balls and other balls as well ...
  • How to Do the Right Thing 
    Maes, Pattie (1989-10-01)
    This paper presents a novel approach to the problem of action selection for an autonomous agent. An agent is viewed as a collection of competence modules. Action selection is modeled as an emergent property of an ...
  • How to Get onto the System 
    Dowson, Mark (1971-04-01)
    This memo is intended to get very new users started on the MAC AI system. It presents some simple rituals for making and editing fields, getting print outs, making microtapes, and so on. Most of the rituals given are not ...
  • How to Play Twenty Questions with Nature and Win 
    Richards, Whitman (1982-12-01)
    The 20 Questions Game played by children has an impressive record of rapidly guessing an arbitrarily selected object with rather few, well-chosen questions. This same strategy can be used to drive the perceptual process, ...
  • A Human Oriented Logic for Automatic Theorem Proving 
    Nevins, Arthur J. (1972-10-01)
    The automation of first order logic has received comparatively little attention from researcher intent upon synthesizing the theorem proving mechanism used by humans. The dominant point of view [15], [18] has been that ...
  • Hypergeometric Functions in MATHLAB 
    Wilson, Lewis (1970-06-01)
    This memo describers some of the important properties and manipulations of Hypergeometric Functions which my be useful in MATHLAB. A convention for representing the function is adopted which is readily adaptable to ...
  • Hypothesizing and Refining Causal Models 
    Doyle, Richard J. (1984-12-01)
    An important common sense competence is the ability to hypothesize causal relations. This paper presents a set of constraints which make the problem of formulating causal hypotheses about simple physical systems a ...
  • Hypothesizing Channels through Free-Space in Solving the Findpath Problem 
    Donald, Bruce R. (1983-06-01)
    Given a polyhedral environment, a technique is presented for hypothesizing a channel volume through the free space containing a class of successful collision-free paths. A set of geometric constructions between obstacle ...
  • A Hypothetical Monologue Illustrating the Knowledge Underlying Program Analysis 
    Shrobe, Howard E.; Waters, Richard C.; Sussman, Gerald J. (1979-01-01)
    Automated Program Analysis is the process of discovering decompositions of a system into sub-units such that the behavior of the whole program can be inferred from the behavior of its parts. Analysis can be employed ...
MIT-Mirage