Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

Planned maintenance alert - Monday, April 21: DSpace@MIT will undergo maintenance activities that will affect service availability and access to file content. While the service interruptions should be brief, access to file content may take longer to restore. Status updates will be posted to http://3down.mit.edu/.

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

Sort by: Order: Results:

  • Steele, Guy Lewis, Jr. (1978-05-01)
    We have developed a compiler for the lexically-scoped dialect of LISP known as SCHEME. The compiler knows relatively little about specific data manipulation primitives such as arithmetic operators, but concentrates ...
  • Hutchinson, James M. (1993-12-01)
    Nonlinear multivariate statistical techniques on fast computers offer the potential to capture more of the dynamics of the high dimensional, noisy systems underlying financial markets than traditional models, while ...
  • Beal, Jacob; Gilbert, Seth (2003-12-17)
    We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...
  • Beal, Jacob; Gilbert, Seth (2003-12-17)
    We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...
  • Fergus, Rob; Torralba, Antonio; Freeman, William T. (2006-09-02)
    We call a random lens one for which the function relating the input light ray to the output sensor location is pseudo-random. Imaging systems with random lensescan expand the space of possible camera designs, allowing new ...
  • McAllester, David; Milch, Brian; Goodman, Noah D. (2008-05-03)
    We consider three desiderata for a language combining logic and probability: logical expressivity, random-world semantics, and the existence of a useful syntactic condition for probabilistic independence. Achieving these ...
  • Taycher, Leonid; Darrell, Trevor (2001-09-01)
    Visibility constraints can aid the segmentation of foreground objects observed with multiple range images. In our approach, points are defined as foreground if they can be determined to occlude some {em empty space} in the ...
  • Stiefelhagen, Rainer; Darrell, Trevor; Urtasun, Raquel; Geiger, Andreas (2008-09-26)
    Non-linear dimensionality reduction methods are powerful techniques to deal with high-dimensional datasets. However, they often are susceptible to local minima and perform poorly when initialized far from the global optimum, ...
  • Horn, Berthold K.P. (MIT Artificial Intelligence Laboratory, 1977-09)
    A representation for numbers using two computer words is discussed, where the value represented is the ratio of the corresponding integers. This allows for better dynamic range and relative accuracy than single-precision ...
  • Micali, Silvio; Chen, Jing (2009-11-10)
    The currently prevailing equilibrium-based approach to mechanism design suffers from a plurality of fundamental problems, and new conceptual frameworks are needed to solve or sufficiently alleviate them. In this paper, we ...
  • Shroff, Ameya (2013-06-06)
    We envision a world in which robots and humans can collaborate to perform complex tasks in real-world environments. Current motion planners successfully generate trajectories for a robot with multiple degrees of freedom, ...
  • Solo, David M. (MIT Artificial Intelligence Laboratory, 1986-08)
    The automatic layout of unbounded n-ary tree structures is a problem of subjectively meshing two independent goals: clarity and space efficiency. This paper presents a minimal set of subjective aesthetics which insures ...
  • Serre, Thomas; Riesenhuber, Maximilian (2004-07-27)
    Riesenhuber \& Poggio recently proposed a model of object recognitionin cortex which, beyond integrating general beliefs about the visualsystem in a quantitative framework, made testable predictions aboutvisual processing. ...
  • Lieberman, Henry; Hewitt, Carl (1981-10-01)
    In previous heap storage systems, the cost of creating objects and garbage collection is independent of the lifetime of the object. Since objects with short lifetimes account for a large portion of storage use, it's ...
  • Gordon, Steven J.; Seering, Warren P. (1988-05-01)
    A light stripe vision system is used to measure the location of polyhedral features of parts from a single frame of video camera output. Issues such as accuracy in locating the line segments of intersection in the image ...
  • Carbin, Michael; Kim, Deokhwan; Misailovic, Sasa; Rinard, Martin C. (2011-11-15)
    A number of approximate program transformations have recently emerged that enable transformed programs to trade accuracy of their results for increased performance by dynamically and nondeterministically modifying variables ...
  • Brown, Richard (MIT Artificial Intelligence Laboratory, 1976-10)
    Rather.
  • Moore, Robert Carter (1975-12-01)
    One very useful idea in AI research has been the notion of an explicit model of a problem situation. Procedural deduction languages, such as PLANNER, have been valuable tools for building these models. But PLANNER and its ...
  • Steels, Luc (1979-06-01)
    This report describes a domain independent reasoning system. The system uses a frame-based knowledge representation language and various reasoning techniques including constraint propagation, progressive refinement, ...
  • McAllester, David Allen (1982-04-01)
    RUP (Reasoning Utility Package) is a collection of procedures for performing various computations relevant to automated reasoning. RUP contains a truth maintenance system (TMS) which can be used to perform simple ...
MIT-Mirage