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:

  • Goldstein, Ira P.; Miller, Mark L. (1976-12-01)
    The application of artificial intelligence (AI) techniques to the design of personal learning environments is an enterprise of both theoretical and practical interest. In the short term, the process of developing and ...
  • Shashua, Ammon (1994-01-01)
    In the general case, a trilinear relationship between three perspective views is shown to exist. The trilinearity result is shown to be of much practical use in visual recognition by alignment --- yielding a direct method ...
  • Beal, Jacob (2001-08-13)
    I present an algorithm which allows two agents to generate a simple language based only on observations of a shared environment. Vocabulary and roles for the language are learned in linear time. Communication is robust and ...
  • Nagpal, Radhika; Coore, Daniel (1998-02-01)
    Amorphous computing is the study of programming ultra-scale computing environments of smart sensors and actuators cite{white-paper}. The individual elements are identical, asynchronous, randomly placed, embedded and ...
  • Ullman, Shimon; Basri, Ronen (1988-07-01)
    This paper examines the recognition of rigid objects bounded by smooth surfaces using an alignment approach. The projected image of such an object changes during rotation in a manner that is difficult to predict. A ...
  • Basri, Ronen (1991-11-01)
    The recognition of objects with smooth bounding surfaces from their contour images is considerably more complicated than that of objects with sharp edges, since in the former case the set of object points that generates ...
  • Edwards, D.J.; Hart, T.P. (1961-12-01)
    The Alpha-Beta heuristic is a method for pruning unneeded branches from the move tree of a game. The algorithm makes use of information gained about part of the tree to reject those branches which will not affect the ...
  • Braunegg, David J. (1989-09-01)
    Representing the world in terms of visible surfaces and the freespacesexisting between these surfaces and the viewer is an important problemsin robotics. Recently, researchers have proposed using the 3DsDelaunay ...
  • Negahdaripour, Shahriar (1987-01-01)
    We study the conditions under which a perspective motion field can have multiple interpretations. Furthermore, we show that in most cases, the ambiguity in the interpretation of a motion field can be resolved by imposing ...
  • Kleer, Johan de; Doyle, Jon; Rich, Charles; Steele, Guy L., Jr.; Sussman, Gerald Jay (1978-01-01)
    We have implemented an interpreter for a rule-based system, AMORD, based on a non-chronological control structure and a system of automatically maintained data-dependencies. The purpose of this paper is to serve as a ...
  • Abelson, Harold; Allen, Don; Coore, Daniel; Hanson, Chris; Homsy, George; Knight, Thomas F., Jr.; Nagpal, Radhika; Rauch, Erik; Sussman, Gerald Jay; Weiss, Ron (1999-08-29)
    Amorphous computing is the development of organizational principles and programming languages for obtaining coherent behaviors from the cooperation of myriads of unreliable parts that are interconnected in unknown, ...
  • Poggio, Tomaso; Koch, Christof (1984-05-01)
    A large gap exists at present between computational theories of vision and their possible implementation in neural hardware. The model of computation provided by the digital computer is clearly unsatisfactory for the ...
  • Koch, Christof; Marroquin, Jose; Yuille, Alan (1985-06-01)
    Many problems in early vision can be formulated in terms of minimizing an energy or cost function. Examples are shape-from-shading, edge detection, motion analysis, structure from motion and surface interpolation ...
  • Marr, D.; G. Palm,; Poggio, T. (1977-10-01)
    Marr & Poggio (1976) recently described a cooperative algorithm that solves the correspondence problem for stereopsis. This article uses a probabilistic technique to analyze the convergence of that algorithm, and ...
  • Little, James J.; Verri, Alessandro (1988-08-01)
    Several algorithms for optical flow are studied theoretically and experimentally. Differential and matching methods are examined; these two methods have differing domains of application- differential methods are best ...
  • Marr, D. (1976-10-01)
    Almost nothing can be deduced about a general 3-D surface given only its occluding contours in an image, yet contour information is easily and effectively used by us to infer the shape of a surface. Therefore, implicit ...
  • Ihrie, David Wayne (1978-05-01)
    The research described in this report is an attempt to evaluate the educational effects of a computer game known as Wumpus. A set of five synthetic computer students was taken as a model of the progress of real students ...
  • Hildreth, Ellen C.; Koch, Christof (1986-12-01)
    This paper reviews a number of aspects of visual motion analysis in biological systems from a computational perspective. We illustrate the kinds of insights that have been gained through computational studies and how ...
  • Chaney, Ronald D. (1992-10-01)
    The interpretation and recognition of noisy contours, such as silhouettes, have proven to be difficult. One obstacle to the solution of these problems has been the lack of a robust representation for contours. The contour ...
  • Marr, D. (1975-06-01)
    A theory of early and intermediate visual information processing is given, which extends to about the level of figure-ground separation. Its core is a computational theory of texture vision. Evidence obtained from ...
MIT-Mirage