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:

  • Clinger, William (1985-08-01)
    Data and procedures and the values they amass, Higher-order functions to combine and mix and match, Objects with their local state, the message they pass, A property, a package, the control of point for a catch- In the ...
  • Martin, William; Hart, Timothy (1964-04-01)
    This memo describes changes to the LISP system by several people. The changes reduce printout and give the user more control over it. They also make it possible for LISP to communicate with the teletype and the disk. The ...
  • Vutukuru, Mythili; Feamster, Nick; Walfish, Michael; Balakrishnan, Hari; Shenker, Scott (2006-04-14)
    IP prefixes undermine three goals of Internet routing: accurate reflection of network-layer reachability, secure routing messages, and effective traffic control. This paper presents Atomic IP (AIP), a simple change to ...
  • Yuille, Alan; Ullman, Shimon (1987-11-01)
    sMany theories of structure from motion divide the process into twosparts which are solved using different assumptions. Smoothness of thesvelocity field is often assumed to solve the motion correspondencesproblem, and then ...
  • Tseng, Jessica H.; Asanovic, Krste (2006-09-18)
    RingScalar is a complexity-effective microarchitecture for out-of-order superscalar processors, that reduces the area, latency, and power of all major structures in the instruction flow. The design divides an N-way ...
  • Williams, Brian C.; Ono, Masahiro (2009-04-22)
    This paper proposes a new market-based distributed planning algorithm for multi-agent systems under uncertainty, called MIRA (Market-based Iterative Risk Allocation). In large coordination problems, from power grid management ...
  • Rakhlin, Alexander; Panchenko, Dmitry; Mukherjee, Sayan (2004-01-27)
    In this paper we focus on the problem of estimating a bounded density using a finite combination of densities from a given class. We consider the Maximum Likelihood Procedure (MLE) and the greedy procedure described by ...
  • Rakhlin, Alexander; Panchenko, Dmitry; Mukherjee, Sayan (2004-01-27)
    In this paper we focus on the problem of estimating a boundeddensity using a finite combination of densities from a givenclass. We consider the Maximum Likelihood Procedure (MLE) and the greedy procedure described by Li ...
  • Vito, Ernesto De; Caponnetto, Andrea (2005-05-16)
    We show that recent results in [3] on risk bounds for regularized least-squares on reproducing kernel Hilbert spaces can be straightforwardly extended to the vector-valued regression setting. We first briefly introduce ...
  • Edsinger, Aaron (2007-01-16)
    Human environments present special challenges for robot manipulation. They are often dynamic, difficult to predict, and beyond the control of a robot engineer. Fortunately, many characteristics of these settings can be ...
  • Taalebinezhaad, M. Ali (1992-09-01)
    In many motion-vision scenarios, a camera (mounted on a moving vehicle) takes images of an environment to find the "motion'' and shape. We introduce a direct-method called fixation for solving this motion-vision problem ...
  • Lozano-Perez, Tomas (1982-12-01)
    The industrial robot's principal advantage over traditional automation is programmability. Robots can perform arbitrary sequences of pre-stored motions or of motions computed as functions of sensory input. This paper ...
  • Lozano-Perez, Tomas (1982-12-01)
    The industrial robot's principal advantage over traditional automation is programmability. Robots can perform arbitrary sequences of pre-stored motions or of motions computed as functions of sensory input. This paper ...
  • Brooks, Rodney A. (1989-02-01)
    Most animals have significant behavioral expertise built in without having to explicitly learn it all from scratch. This expertise is a product of evolution of the organism; it can be viewed as a very long term form ...
  • Nelson, Stewart; Levitt, Michael (1969-02-01)
    This document describes a set of routines which have been provided at both the monitor and user level to facilitate the following operations: 1) Vidissector input; 2) Pot Box input; 3) Arm motion; and 4) Display list ...
  • Cass, Todd A. (1988-05-01)
    Techniques, suitable for parallel implementation, for robust 2D model-based object recognition in the presence of sensor error are studied. Models and scene data are represented as local geometric features and robust ...
  • Ferrell, Cynthia (1993-05-01)
    This thesis presents methods for implementing robust hexpod locomotion on an autonomous robot with many sensors and actuators. The controller is based on the Subsumption Architecture and is fully distributed over ...
  • Beal, Jacob (2003-05-01)
    For a very large network deployed in space with only nearby nodes able to talk to each other, we want to do tasks like robust routing and data storage. One way to organize the network is via a hierarchy, but hierarchies ...
  • Alter, Tao Daniel (1992-09-01)
    Alignment is a prevalent approach for recognizing 3D objects in 2D images. A major problem with current implementations is how to robustly handle errors that propagate from uncertainties in the locations of image ...
  • Hofmann, Andreas (2006-04-28)
    Effective use of robots in unstructured environments requires that they have sufficient autonomy and agility to execute task-level commands successfully. A challenging example of such a robot is a bipedal walking machine. ...
MIT-Mirage