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:

  • Demsky, Brian; Rinard, Martin (2004-05-18)
    Model-based data structure repair is a promising techniquefor enabling programs to continue to execute successfullyin the face of otherwise fatal data structure corruption errors.Previous research in this eld relied on ...
  • Horn, Berthold K.P. (MIT Artificial Intelligence Laboratory, 1973-03-08)
    This paper presents a solution to the problem of determining the distribution of an absorbing substance inside a non-opaque non-scattering body from images or ray samplings. It simultaneously solves the problem of determining ...
  • Osman, Eric (1971-09-01)
    This memo describes the version of DDT used as the command level of the A.I. Laboratory Time Sharing System (ITS). Besides the usual program control, examination, and modification features, this DDT provides many ...
  • Das, Sanmay (2006-07-12)
    This thesis seeks to contribute to the understanding of markets populated by boundedly rational agents who learn from experience. Bounded rationality and learning have both been the focus of much research in computer ...
  • Steele, Guy Lewis, Jr. (1977-10-01)
    Folklore states that GOTO statements are 'cheap', while procedure calls are 'expensive'. This myth is largely a result of poorly designed language implementations. The historical growth of this myth is considered. Both ...
  • Lee, Jintae (MIT Artificial Intelligence Laboratory, 1989-08)
    In this report, I describe a language, called Decision Representation Language (DRL), for representing the qualitative aspects of decision making processes such as the alternatives being evaluated, goals to satisfy, and ...
  • Khabbazian, Majid; Kowalski, Dariusz; Kuhn, Fabian; Lynch, Nancy (2011-02-23)
    In much of the theoretical literature on global broadcast algorithms for wireless networks, issues of message dissemination are considered together with issues of contention management. This combination leads to complicated ...
  • Guzman, Adolfo (1967-09-01)
    This memorandum describes a program which finds bodies in a scene, presumably formed by 3-dimensional objects, with some of them perhaps not completely visible.
  • Guzman, Adolfo (1969-01-01)
    The program described here takes as its input a collection of lines, vertices and surfaces describing a scene, and analyzes the scene into a composition of three-dimensional objects. The program does not need to know the ...
  • Ragan-Kelley, Jonathan; Doggett, Michael; Lehtinen, Jaakko; Chen, Jiawen; Durand, Fredo (2010-03-29)
    We propose decoupled sampling, an approach that decouples shading from visibility sampling in order to enable motion blur and depth-of-field at reduced cost. More generally, it enables extensions of modern real-time graphics ...
  • Su, Sara L.; Durand, Fredo; Agrawala, Maneesh (2005-04-12)
    A major obstacle in photography is the presence of distracting elements that pull attention away from the main subject and clutter the composition. In this article, we present a new image-processing technique that reduces ...
  • Ristad, Eric Sven (1986-04-01)
    This paper is a formal analysis of whether generalized phrase structure grammar's (GPSG) weak context-free generative power will allow it to achieve three of its central goals: (1) to characterize all and only the ...
  • Tauber, Joshua A.; Garland, Stephen J. (2004-07-19)
    The IOA language provides notations for defining both primitive and composite I/O automata.This note describes, both formally and with examples, the constraints on these definitions, thecomposability requirements for the ...
  • 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 ...
MIT-Mirage