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:

  • The Image Irradiance Equation: Its Solution and Application 
    Bruss, Anna R. (1981-06-01)
    How much information about the shape of an object can be inferred from its image? In particular, can the shape of an object be reconstructed by measuring the light it reflects from points on its surface? These questions ...
  • Imagination and Situated Cognition 
    Stein, Lynn Andrea (1991-02-01)
    A subsumption-based mobile robot is extended to perform cognitive tasks. Following directions, the robot navigates directly to previously unexplored goals. This robot exploits a novel architecture based on the idea ...
  • Implementation of a Theory for Inferring Surface Shape from Contours 
    Stevens, Kent A. (1982-08-01)
    Human vision is adept at inferring the shape of a surface from the image of curves lying across the surface. The strongest impression of 3-D shape derives from parallel (but not necessarily equally spaced) contours. ...
  • Implementation of a Theory of Edge Detection 
    Hildreth, Ellen C. (1980-04-01)
    This report describes the implementation of a theory of edge detection, proposed by Marr and Hildreth (1979). According to this theory, the image is first processed independently through a set of different size filters, ...
  • Implementing Asynchronous Distributed Systems Using the IOA Toolkit 
    Georgiou, Chryssis; Mavrommatis, Panayiotis P.; Tauber, Joshua A. (2004-10-06)
    This document is a report about the capabilities and performance of the IOA Toolkit, and in particularthe tools that provide support for implementing and running distributed systems (checker,composer, code generator). The ...
  • Implementing Atomic Data through Indirect Learning in Dynamic Network 
    Konwar, K.; Musial, P.M.; Nicolau, N.C.; Shvartsman., A.A. (2006-10-12)
    Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that suchservices must deal with communicating devices that may join and leave the system, and fail or ...
  • Implementing Distributed Systems Using Linear Naming 
    Bawden, Alan (1993-03-01)
    Linear graph reduction is a simple computational model in which the cost of naming things is explicitly represented. The key idea is the notion of "linearity". A name is linear if it is only used once, so with linear ...
  • Implementing Probabilistically Checkable Proofs of Proximity 
    Bhattacharyya, Arnab (2005-08-08)
    Abstract: In this paper, we describe a proof-of-concept implementation of the probabilistically checkable proof of proximity (PCPP) system described by Ben-Sasson and Sudan in \\cite{bs05}. In particular, we implement a ...
  • Implementing Universal Computation in an Evolutionary System 
    Werfel, Justin (2002-07-01)
    Evolutionary algorithms are a common tool in engineering and in the study of natural evolution. Here we take their use in a new direction by showing how they can be made to implement a universal computer. We consider ...
  • The Implicit Constraints of the Primal Sketch 
    Grimson, W.E.L (1981-10-01)
    Computational theories of structure-from-motion and stereo vision only specify the computation of three-dimensional surface information at points in the image at which the irradiance changes. Yet, the visual perception ...
  • Importance Sampling for Reinforcement Learning with Multiple Objectives 
    Shelton, Christian Robert (2001-08-01)
    This thesis considers three complications that arise from applying reinforcement learning to a real-world application. In the process of using reinforcement learning to build an adaptive electronic market-maker, we find ...
  • Impossibility of boosting distributed service resilience 
    Attie, Paul; Guerraoui, Rachid; Kouznetsov, Petr; Lynch, Nancy; Rajsbaum, Sergio (2005-02-25)
    We prove two theorems saying that no distributed system in whichprocesses coordinate using reliable registers and f-resilient servicescan solve the consensus problem in the presence of f+1 undetectableprocess stopping ...
  • Improving 802.11 Range with Forward Error Correction 
    Riemann, Reina; Winstein, Keith (2005-02-24)
    The ISO/IEC 8802-11:1999(E) specification uses a 32-bit CRC for error detection and whole-packet retransmissions for recovery. In long-distance orhigh-interference links where the probability of a bit error is high,this ...
  • Improving Multi-class Text Classification with Naive Bayes 
    Rennie, Jason D. M. (2001-09-01)
    There are numerous text documents available in electronic form. More and more are becoming available every day. Such documents represent a massive amount of information that is easily accessible. Seeking value in this huge ...
  • Improving Multiclass Text Classification with the Support Vector Machine 
    Rennie, Jason D. M.; Rifkin, Ryan (2001-10-16)
    We compare Naive Bayes and Support Vector Machines on the task of multiclass text classification. Using a variety of approaches to combine the underlying binary classifiers, we find that SVMs substantially outperform Naive ...
  • Incorporating MIDAS Routines into PDP-6 LISP 
    Silver, Roland (1967-03-01)
    Some PDP6 LISP users have felt a need for a way to incorporate MIDAS subroutines into LISP. LISP has been changed to let you do this, using files found on the LISP SYSTEM microtape. You write a routine for LISP in much the ...
  • The Incremental Garbage Collection of Processes 
    Hewitt, Carl; Baker, Henry G. Jr. (MIT Artificial Intelligence Laboratory, 1977-06)
    This paper investigates some problems associated with an argument evaluation order that we call "future" order, which is different from both call-by-name and call-by-value. In call-by-future, each formal parameter of a ...
  • The Incremental Garbage Collection Processes 
    Baker, Henry G.; Hewitt, Carl (1977-12-01)
    This paper investigates some problems associated with an expression evaluation order that we call "future" order, which is different from call-by-name, call-by-value, and call-by-need. In future order evaluation, an ...
  • The Incremental Rigidity Scheme for Recovering Structure from Motion: Position vs. Velocity Based Formulations 
    Grzywacz, Norberto M.; Hildreth, Ellen C. (1985-10-01)
    Perceptual studies suggest that the visual system uses the "rigidity" assumption to recover three dimensional structures from motion. Ullman (1984) recently proposed a computational scheme, the incremental rigidity ...
  • Indexing for Visual Recognition from a Large Model Base 
    Breuel, Thomas M. (1990-08-01)
    This paper describes a new approach to the model base indexing stage of visual object recognition. Fast model base indexing of 3D objects is achieved by accessing a database of encoded 2D views of the objects using a ...
MIT-Mirage