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:

  • 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.
  • Azar, Pablo; Micali, Silvio (2012-05-08)
    We study the problem of profit maximization in auctions of one good where the buyers' valuations are drawn from independent distributions. When these distributions are known to the seller, Myerson's optimal auction is a ...
  • Azar, Pablo Daniel; Micali, Silvio (2012-06-14)
    We study the problem of an auctioneer who wants to maximize her profits. In our model, there are n buyers with private valuations drawn from independent distributions F_1,...,F_n. When these distributions are known to the ...
  • Caponnetto, Andrea (2006-09-10)
    We develop some new error bounds for learning algorithms induced by regularization methods in the regression setting. The "hardness" of the problem is characterized in terms of the parameters r and s, the first related ...
  • Geiger, Davi; Poggio, Tomaso (1988-09-01)
    Many problems in early vision are ill posed. Edge detection is a typical example. This paper applies regularization techniques to the problem of edge detection. We derive an optimal filter for edge detection with a ...
  • Sanger, Terence D. (1989-01-01)
    We investigate the properties of feedforward neural networks trained with Hebbian learning algorithms. A new unsupervised algorithm is proposed which produces statistically uncorrelated outputs. The algorithm causes ...
  • Waters, Richard C. (1989-01-01)
    The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to ...
  • Waters, Richard C. (1989-01-01)
    The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to understand ...
MIT-Mirage