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:

  • Steele, Guy Lewis, Jr. (1980-08-01)
    The constraint paradigm is a model of computation in which values are deduced whenever possible, under the limitation that deductions be local in a certain sense. One may visualize a constraint 'program' as a network ...
  • Taylor, Michael Bedford (2004-06-07)
    In this paper, we introduce the concept of a deionizer. A deionizeris a special type of partial evaluator whose purpose is to create a newversion of a program that can run without accessing a partial set of I/O resources.Although ...
  • Gajos, Krzysztof; Shrobe, Howard (2003-06-01)
    The dream of pervasive computing is slowly becoming a reality. A number of projects around the world are constantly contributing ideas and solutions that are bound to change the way we interact with our environments and ...
  • Dally, William J.; McMillan, Leonard; Bishop, Gary; Fuchs, Henry (1997-05-02)
    This paper introduces the delta tree, a data structure that represents an object using a set of reference images. It also describes an algorithm for generating arbitrary re-projections of an object by traversing its ...
  • Drescher, Gary L. (1988-12-01)
    An artificial universe is defined that has entirely deterministic laws with exclusively local interactions, and that exhibits the fundamental quantum uncertainty phenomenon: superposed states mutually interfere, but ...
  • Mellor, J.P.; Teller, Seth; Lozano-Perez, Tomas (1996-11-01)
    Recovering three-dimensional information from two-dimensional images is the fundamental goal of stereo techniques. The problem of recovering depth (three-dimensional information) from a set of images is essentially the ...
  • Horn, Berthold K.P. (1977-09-01)
    Methods for calculating the distribution of absorption densities in a cross section through an object from density integrals along rays in the plane of the cross section are well known, but are restricted to particular ...
  • Zabih, Ramin (MIT Artificial Intelligence Laboratory, 1988-08)
    Non-deterministic LISP can be used to describe a search problem without specifying the method used to solve the problem. We show that SCHEMER, a non-deterministic dialect of SCHEME, can support dependency-directed backtracking ...
  • Kuper, Ron I. (1989-05-01)
    Software bugs are violated specifications. Debugging is the process that culminates in repairing a program so that it satisfies its specification. An important part of debugging is localization, whereby the smallest ...
  • Shrobe, Howard Elliot (1979-04-01)
    Artificial Intelligence research involves the creation of extremely complex programs which must possess the capability to introspect, learn, and improve their expertise. Any truly intelligent program must be able to ...
  • Wertheimer, Jeremy M. (1989-02-01)
    Formalizing algorithm derivations is a necessary prerequisite for developing automated algorithm design systems. This report describes a derivation of an algorithm for incrementally matching conjunctive patterns against ...
  • Minsky, Marvin (1963-12-01)
    Derivator is a PDP-1 program for examining the solutions to differential equations by inspection of a visual display of trajectories. Because fixed-point arithmetic is used (in order to maintain visual display speeds), ...
  • Brady, Michael; Ponce, Jean; Yuille, Alan; Asada, Haruo (1985-01-01)
    This paper continues our work on visual representation s of three-dimensional surfaces [Brady and Yuille 1984b]. The theoretical component of our work is a study of classes of surface curves as a source of constraint ...
  • Gresser, Jean-Yves (1968-09-01)
    The immediate purpose of the research on Intelligent Automata is to have an autonomous machine able to understand uncomplicated commands and to manipulate simple objects without human intervention. This thesis is concerned ...
  • Hewitt, Carl (1972-04-01)
    Planner is a formalism for proving theorems and manipulating models in a robot. The formalism is built out of a number of problem-solving primitives together with a hierarchical multiprocess backtrack control structure. ...
  • Pitman, Kent (1984-09-01)
    In this paper we discuss the problems associated with the description and manipulation of large systems when their sources are not maintained as single fields. We show why and how tools that address these issues, such ...
  • Krakauer, Lawrence J. (1966-11-01)
    The CNTOUR program plots an intensity relief map of an image which is read from the vidisector camera (TV-B). It may be used as a general purpose aiming, monitoring and focusing program, especially for high-contrast images, ...
  • Gaschnig, John Gary (MIT Artificial Intelligence Laboratory, 1973-03-09)
    Some general properties of textures are discussed for a restricted class of textures. A program is described which inputs a scene using vidisector camera, discerns the texture elements, calculates values for a set of ...
  • Eisenberg, Michael (1989-09-01)
    The Kineticist's Workbench is a computer program currently under development whose purpose is to help chemists understand, analyze, and simplify complex chemical reaction mechanisms. This paper discusses one module ...
  • Levin, Michael Dean (1990-05-01)
    This report explores the design and control issues associated with a brushless actuator capable of achieving extremely high torque accuracy. Models of several different motor - sensor configurations were studied to ...
MIT-Mirage