Advanced Search
DSpace@MIT

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Research and Teaching Output of the MIT Community

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Sort by: Order: Results:

  • Negahdaripour, Shahriar; Yuille, Alan (1986-03-01)
    In this paper, we solve the problem of recovering the motion of an observer relative to a surface which can be locally approximated by a quadratic patch directly from image brightness values. We do not compute the ...
  • Taalebinezhaad, M. Ali (1990-03-01)
    This work introduces a direct method called FIXATION for solving the general motion vision problem. This Fixation method results in a constraint equation between translational and rotational velocities that in combination ...
  • Rich, Charles; Waters, Richard C. (MIT Artificial Intelligence Laboratory, 1981-12)
    Simplifying assumptions — everyone uses them but no one's programming tool explicitly supports them. In programming, as in other kinds of engineering design, simplifying assumptions are an important method for dealing with ...
  • Rosenberg, Steven T. (MIT Artificial Intelligence Laboratory, 1976-08-17)
    An essential step in understanding connected discourse is the ability to link the meanings of successive sentences together. Given a growing database to which new sentence meanings must be linked, which out of many possible ...
  • Winston, Patrick (1969-05-01)
    Warren Teitelman presented a novel scheme for real time character recognition in his master's thesis submitted in June of 1963. A rectangle, in which a character is to be drawn, is divided into two parts, one shaded ...
  • Kemp, Charles; Griffiths, Thomas L.; Tenenbaum, Joshua B. (2004-07-22)
    We present a framework for learning abstract relational knowledge with the aimof explaining how people acquire intuitive theories of physical, biological, orsocial systems. Our approach is based on a generative relational ...
  • Sivic, Josef; Russell, Bryan C.; Efros, Alexei A.; Zisserman, Andrew; Freeman, William T. (2005-02-25)
    Given a set of images containing multiple object categories,we seek to discover those categories and their image locations withoutsupervision. We achieve this using generative modelsfrom the statistical text literature: ...
  • Haase, Kenneth W., Jr. (1986-04-01)
    Cyrano is a thoughtful reimplementation of Lenat's controversial Eurisko program, designed to perform automated discovery and concept formation in a variety of technical fields. The 'thought' in the reimplementation ...
  • Haase, Ken (MIT Artificial Intelligence Laboratory, 1987-03)
    The emergence in 1976 of Doug Lenat's mathematical discovery program AM [Len76] [Len82a] was met with suprise and controversy; AM's performance seemed to bring the dream of super-intelligent machines to our doorstep, with ...
  • Urtasun, Raquel; Darrell, Trevor (2007-03-28)
    Supervised learning is difficult with high dimensional input spacesand very small training sets, but accurate classification may bepossible if the data lie on a low-dimensional manifold. GaussianProcess Latent Variable ...
  • Bulthoff, Henrich; Fahle, Manfred (1989-09-01)
    The binocular perception of shape and depth relations between objects can change considerably if the viewing direction is changed only by a small angle. We explored this effect psychophysically and found a strong depth ...
  • Binford, Thomas O. (1970-03-01)
    This note describes a system which compiles various forms of LISP lists and arrays into display commands for the DEC 340 display, and provides supporting functions for scaling, for moving elements in a display, for pot ...
  • Balas, Benjamin J.; Sinha, Pawan (2003-08-13)
    A fundamental question in visual neuroscience is how to represent image structure. The most common representational schemes rely on differential operators that compare adjacent image regions. While well-suited to encoding ...
  • Balas, Benjamin J.; Sinha, Pawan (2003-08-13)
    A fundamental question in visual neuroscience is how to represent image structure. The most common representational schemes rely on differential operators that compare adjacent image regions. While well-suited to encoding ...
  • Basri, Ronen; Weinshall, Daphna (1992-07-01)
    Similarity measurements between 3D objects and 2D images are useful for the tasks of object recognition and classification. We distinguish between two types of similarity metrics: metrics computed in image-space (image ...
  • Tzanov, Velin K. (2006-12-05)
    The main goal of this thesis is to demonstrate the applicability of the distributed systems paradigm to robotic systems. This goal is accomplished by presenting two solutions to the Distributed Area Search problem: organizing ...
  • Qumsiyeh, Dany M. (2008-07-14)
    This thesis investigates the feasibility of a smart building evacuation system, capable of guiding occupants along safe paths to exits and responding to changing threats. Inspired by developments in amorphous computing, ...
  • Oshman, Rotem; Lynch, Nancy; Kuhn, Fabian (2009-11-10)
    In this report we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen ...
  • Block, Stephen (2007-03-05)
    Many applications of autonomous agents require groups to work in tight coordination. To be dependable, these groups must plan, carry out and adapt their activities in a way that is robust to failure and to uncertainty. ...
  • Mataric, Maja J. (1990-05-01)
    A distributed method for mobile robot navigation, spatial learning, and path planning is presented. It is implemented on a sonar-based physical robot, Toto, consisting of three competence layers: 1) Low-level navigation: ...
MIT-Mirage