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:

  • Agarwal, Anant; Psota, James; Eastep, Jonathan; Konstantakopoulos, Theodoros (2008-11-11)
    On-chip interconnection networks (OCNs) such as point-to-point networks and buses form the communication backbone in systems-on-a-chip, multicore processors, and tiled processors. OCNs can consume significant portions of ...
  • Mellor, J.P. (1995-01-01)
    Enhanced reality visualization is the process of enhancing an image by adding to it information which is not present in the original image. A wide variety of information can be added to an image ranging from hidden ...
  • Su, Sara L. (2009-06-24)
    Graphical editors have introduced great flexibility to the designer's workflow, providing powerful digital tools and enabling the creation of complex and compelling designs. This thesis presents methods for improving these ...
  • Rinard, Martin; Cadar, Cristian; Dumitran, Daniel; Roy, Daniel M.; Jr., William S. Beebee (2004-02-06)
    We present a new technique, failure-oblivious computing,that enables programs to continue to execute through memoryerrors without memory corruption. Our safe compilerfor C inserts checks that dynamically detect invalid ...
  • Brock, David L. (1987-05-01)
    Humans can effortlessly manipulate objects in their hands, dexterously sliding and twisting them within their grasp. Robots, however, have none of these capabilities, they simply grasp objects rigidly in their end ...
  • Leong, Ben; Liskov, Barbara; Demaine, Erik D. (2004-08-13)
    EpiChord is a DHT lookup algorithm that demonstrates that we canremove the O(log n)-state-per-node restriction on existing DHTtopologies to achieve significantly better lookup performance andresilience using a novel reactive ...
  • Chen, Jing; Micali, Silvio; Pass, Rafael (2012-06-22)
    In settings of incomplete information we put forward an epistemic framework for designing mechanisms that successfully leverage the players' arbitrary higher-order beliefs, even when such beliefs are totally wrong, and ...
  • Richards, W.A.; Rubin, J.M.; Hoffman, D.D. (1981-06-01)
    Many problems in biological information processing require the solution to a complex system of equations in many unknown variables. An equation-counting procedure is described for determining whether such a system of ...
  • Balasubramanian, Vijay (1993-01-01)
    This report studies when and why two Hidden Markov Models (HMMs) may represent the same stochastic process. HMMs are characterized in terms of equivalence classes whose elements represent identical stochastic processes. ...
  • Girosi, Federico (1997-05-01)
    In the first part of this paper we show a similarity between the principle of Structural Risk Minimization Principle (SRM) (Vapnik, 1982) and the idea of Sparse Approximation, as defined in (Chen, Donoho and Saunders, ...
  • Paterson, Michael Stewart (1967-08-01)
    A central problem in the mathematical teory of computers and computation is to find a suitable framework for expressing the ececution of a computer program by a computer. Within the framework we want to be alble to provide ...
  • Donald, Bruce Randall (1987-07-01)
    Robots must plan and execute tasks in the presence of uncertainty. Uncertainty arises from sensing errors, control errors, and uncertainty in the geometry of the environment. The last, which is called model error, has ...
  • Ivanov, Yuri; Serre, Thomas; Bouvrie, Jacob (2005-12-14)
    In this paper we describe a technique of classifier combination used in a human identification system. The system integrates all available features from multi-modal sources within a Bayesian framework. The framework allows ...
  • Martin, Martin C. (2003-05-01)
    This paper presents a novel algorithm for learning in a class of stochastic Markov decision processes (MDPs) with continuous state and action spaces that trades speed for accuracy. A transform of the stochastic MDP ...
  • Meila, Marina; Jordan, Michael I.; Morris, Quaid (1998-09-01)
    This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EM and the Minimum Spanning ...
  • Meila, Marina; Jordan, Michael I.; Morris, Quaid (1997-06-01)
    This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EMand the Minimum Spanning ...
  • Minsky, Marvin (1967-02-01)
    An interesting practical and theoretical problem is putting bounds on how much computation one needs to find the stereo-disparity between two narrow-angle stereo scenes. By narrow angle I mean situations wherein the angle ...
  • Lee, Hsien-Che (1988-08-01)
    \0\05{\0\0\0\0\0\0\0\0 a uniform wall illuminated by a spot light often gives a strong impression of the illuminant color. How can it be possible to know if it is a white wall illuminated by yellow light or a yellow ...
  • Dengler, Joachim (1990-10-01)
    A new noniterative approach to determine displacement vector fields with discontinuities is described. In order to overcome the limitations of current methods, the problem is regarded as a general modelling problem. ...
  • An, Chae H.; Atkeson, Christopher G.; Hollerbach, John M. (1986-02-01)
    A method of estimating the mass, the location of center of mass, and the moments of inertia of each rigid body link of a robot during general manipulator movement is presented. The algorithm is derived from the ...
MIT-Mirage