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:

  • Basri, Ronen (1991-12-01)
    The task of shape recovery from a motion sequence requires the establishment of correspondence between image points. The two processes, the matching process and the shape recovery one, are traditionally viewed as independent. ...
  • Grimson, W. Eric L.; Huttenlocher, Daniel P. (1989-05-01)
    In model-based recognition, ad hoc techniques are used to decide if a match of data to model is correct. Generally an empirically determined threshold is placed on the fraction of model features that must be matched. ...
  • Evgeniou, Theodoros; Pontil, Massimiliano (1999-05-01)
    This paper presents a computation of the $V_gamma$ dimension for regression in bounded subspaces of Reproducing Kernel Hilbert Spaces (RKHS) for the Support Vector Machine (SVM) regression $epsilon$-insensitive loss function, ...
  • McAllester, David Allen (1987-07-01)
    Ontic is an interactive system for developing and verifying mathematics. Ontic's verification mechanism is capable of automatically finding and applying information from a library containing hundreds of mathematical ...
  • Bouillaguet, Charles; Kuncak, Viktor; Wies, Thomas; Zee, Karen; Rinard, Martin (2006-11-09)
    This paper presents our integration of efficient resolution-based theorem provers into the Jahob data structure verification system. Our experimental results show that this approach enables Jahob to automatically ...
  • Arkoudas, Konstantine; Zee, Karen; Kuncak, Viktor; Rinard, Martin (2004-05-06)
    We present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed-size disk blocks. We prove the implementation correct ...
  • Ullman, Shimon (1975-05-01)
    The paper addresses the following problem: Given an array of light intensities obtained from some scene, find the light sources in the original scene. The following factors are discussed from the point of view of their ...
  • Hewitt, Carl; Jong, Peter de (1982-12-01)
    This paper describes some problems and opportunities associated with conceptual modeling for the kind of "open systems" we foresee must and will be increasingly recognized as a central line of computer system development. ...
  • Ansel, Jason; Kamil, Shoaib; Veeramachaneni, Kalyan; O'Reilly, Una-May; Amarasinghe, Saman (2013-11-01)
    Program autotuning has been shown to achieve better or more portable performance in a number of domains. However, autotuners themselves are rarely portable between projects, for a number of reasons: using a domain-informed ...
  • Totty, Brian K. (1988-05-01)
    The Jellybean Machine is a scalable MIMD concurrent processor consisting of special purpose RISC processors loosely coupled into a low latency network. I have developed an operating system to provide the supportive ...
  • Modzelewski, Kevin; Miller, Jason; Belay, Adam; Beckmann, Nathan; Gruenwald, Charles, III; Wentzlaff, David; Youseff, Lamia; Agarwal, Anant (2010-02-08)
    Cloud computers and multicore processors are two emerging classes of computational hardware that have the potential to provide unprecedented compute capacity to the average user. In order for the user to effectively harness ...
  • Moon, David A.; Wechsler, Allan C. (MIT Artificial Intelligence Laboratory, 1981-04)
    This document is a draft copy of a portion of the Lisp Machine window system manual. It is being published in this form now to make it available, since the complete window system manual is unlikely to be finished in the ...
  • Raphael, Bertram (1963-11-01)
    A computer program has been written in the LISP programming language which accepts information and answers questions presented to it in a restricted form of natural English language. The program achieves its effects by ...
  • Boyd-Wickizer, Silas; Kaashoek, M. Frans; Morris, Robert; Zeldovich, Nickolai (2014-09-16)
    Existing techniques (e.g., RCU) can achieve good multi-core scaling for read-mostly data, but for update-heavy data structures only special-purpose techniques exist. This paper presents OpLog, a general-purpose library ...
  • Ancona, Nicola; Poggio, Tomaso (1993-10-01)
    In the first part of this paper we show that a new technique exploiting 1D correlation of 2D or even 1D patches between successive frames may be sufficient to compute a satisfactory estimation of the optical flow field. ...
  • Ullman, Shimon (1985-12-01)
    The human visual system can recover the 3D shape of moving objects on the basis of motion information alone. Computational studies of this capacity have considered primarily non-planar rigid objects. With respect to ...
  • Indyk, Piotr; Woodruff, David (2004-07-02)
    We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data stream for any real k>2. Together with known lower bounds, this resolves the main problem left open by Alon, Matias, ...
  • Indyk, Piotr; Woodruff, David (2004-07-02)
    We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data stream for any real k>2. Together with known lower bounds, this resolves the main problem left open by Alon, Matias, ...
  • Marroquin, Jose L. (1985-04-01)
    sA very fruitful approach to the solution of image segmentation andssurface reconstruction tasks is their formulation as estimationsproblems via the use of Markov random field models and Bayes theory.sHowever, the ...
  • Jordan, Matthew; Perez, Alejandro (2013-08-15)
    In this paper we present a simple, computationally-efficient, two-tree variant of the RRT* algorithm along with several heuristics.
MIT-Mirage