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:

  • Pacheo, Carlos; Ernst, Michael D. (2004-10-14)
    This paper describes a technique that helps a test engineerselect, from a large set of randomly generated testinputs, a small subset likely to reveal faults in the softwareunder test. The technique takes a program or ...
  • Desai, Ujjaval Y.; Mizuki, Marcelo M.; Masaki, Ichiro; Horn, Berthold K.P. (1996-11-01)
    In this paper, we present a static image compression algorithm for very low bit rate applications. The algorithm reduces spatial redundancy present in images by extracting and encoding edge and mean information. Since ...
  • Hildreth, Ellen C. (1985-09-01)
    The goal of vision is to recover physical properties of objects in a scene, such as the location of object boundaries and the structure, color, and texture of object surfaces, from the two-dimensional image that is ...
  • Grimson, W. Eric L. (1990-04-01)
    Many current recognition systems use constrained search to locate objects in cluttered environments. Previous formal analysis has shown that the expected amount of search is quadratic in the number of model and data features, ...
  • Townsend, William T. (William Thomas) (1988-04-01)
    Previous research in force control has focused on the choice of appropriate servo implementation without corresponding regard to the choice of mechanical hardware. This report analyzes the effect of mechanical properties ...
  • Fischer, Michael J. (1972-04-01)
    This paper was first presented at the Symposium on Complexity of Computer Computations, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, on March 22, 1972. The equivalence problem is to determine the ...
  • Psota, James; Agarwal, Anant; Miller, Jason; Beckmann, Nathan; Kurian, George (2010-02-11)
    Ever since industry has turned to parallelism instead of frequency scaling to improve processor performance, multicore processors have continued to scale to larger and larger numbers of cores. Some believe that multicores ...
  • Breuel, Thomas M. (1990-10-01)
    A polynomial time algorithm (pruned correspondence search, PCS) with good average case performance for solving a wide class of geometric maximal matching problems, including the problem of recognizing 3D objects from ...
  • Grauman, Kristen; Darrell, Trevor (2004-11-22)
    Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature sets' similarity via a voting scheme (which ...
  • Salakhutdinov, Ruslan; Hinton, Geoffrey (2010-08-04)
    We present a new learning algorithm for Boltzmann Machines that contain many layers of hidden variables. Data-dependent statistics are estimated using a variational approximation that tends to focus on a single mode, and ...
  • Levin, Anat; Weiss, Yair; Durand, Fredo; Freeman, William T. (2011-04-04)
    In blind deconvolution one aims to estimate from an input blurred image y a sharp image x and an unknown blur kernel k. Recent research shows that a key to success is to consider the overall shape of the posterior distribution ...
  • Ono, Masahiro; Williams, Brian C. (2008-03-06)
    When controlling dynamic systems such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster by taking a more challenging path. This paper ...
  • Lee, John J. (2008-05-06)
    Algorithms for recognition and retrieval tasks generally call for both speed and accuracy. When scaling up to very large applications, however, we encounter additional significant requirements: adaptability and scalability. ...
  • Roy, Nicholas; He, Ruijie (2009-09-23)
    Online, forward-search techniques have demonstrated promising results for solving problems in partially observable environments. These techniques depend on the ability to efficiently search and evaluate the set of beliefs ...
  • Demsky, Brian; Cadar, Cristian; Roy, Daniel; Rinard, Martin (2003-11-13)
    We present a new error localization tool, Archie, that accepts aspecification of key data structure consistency constraints, then generatesan algorithm that checks if the data structures satisfy theconstraints. We also ...
  • McCamant, Stephen; Morrisett, Greg (2005-05-02)
    Executing untrusted code while preserving security requiresenforcement of memory and control-flow safety policies:untrusted code must be prevented from modifying memory orexecuting code except as explicitly allowed. ...
  • Donald, Bruce R. (MIT Artificial Intelligence Laboratory, 1984-08)
    We describe a simple geometric modelling system called Eight which supports interactive creation, editing, and display of three-dimensional polyhedral solids. Perspective views of a polyhedral environment may be generated, ...
  • De Mol, Christine; Rosasco, Lorenzo; De Vito, Ernesto (2008-07-24)
    Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie ["Regularization and variable selection via the elastic net" J. R. Stat. ...
  • Sussman, Gerald Jay (1977-06-01)
    This report outlines the problem of intelligent failure recovery in a problem-solver for electrical design. We want our problem solver to learn as much as it can from its mistakes. Thus we cast the engineering design ...
  • Liskov, Moses (2003-10-14)
    Electronic cash schemes in which the bank authenticates many coins at once suffer from the problem that coins that are authenticated together can be linked to one another. Unfortunately, unless a user spends coins in a ...
MIT-Mirage