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:

  • Abadi, Daniel J.; Marcus, Adam; Madden, Samuel R.; Hollenbach, Kate (2007-07-06)
    This report describes the Barton Libraries RDF dataset and Longwell querybenchmark that we use for our recent VLDB paper on Scalable Semantic WebData Management Using Vertical Partitioning.
  • Smoliar, Stephen W. (1971-10-01)
    This memo describes the practical implementation of programs written in the language EUTERPE. Details of this language are given in the author's thesis (A Parallel Processing Model of Musical Structures) and will not ...
  • Jones, Joe L.; O'Donnell, Patrick A. (MIT Artificial Intelligence Laboratory, 1985-04)
    This document describes the operation of the Lisp Machine interface to the Unimation Puma 600 Robot Arm. The interface is evolved from a system described in an earlier paper, and much is the same. However, the under-lying ...
  • Lerman, Jerome B. (MIT Artificial Intelligence Laboratory, 1972-06)
    The stored picture facility (FAKETV) allows LISP users, and to some extent machine language users, to access a library of stored images rather than live vidisector scenes. The vidisector functions in LISP have been slightly ...
  • Singer, Neil C.; Seering, Warren P. (1988-02-01)
    The intent of this research is to study the dynamic behavior of a solid body resting on a moving surface. Results of the study are then used to propose methods for controlling the orientation of parts in preparation ...
  • Eastlake, Donald E. (1974-04-01)
    UT is a user telnet program designed to run under the ITS time sharing system. It implements the relatively recent ARPA network negotiating protocol for telnet connections.
  • Michalski, Ryszard S.; Winston, Patrick H. (1985-08-01)
    Variable precision logic is concerned with problems of reasoning with incomplete information and under time constraints. It offers mechanisms for handling trade-offs between the precision of inferences and the ...
  • Horn, Berthold K.P. (1985-03-01)
    We develop a systematic approach to the discovery of parallel iterative schemes for solving the shape-from-shading problem on a grid. A standard procedure for finding such schemes is outlines, and subsequently used ...
  • Somers, David C.; Todorov, Emanuel V.; Siapas, Athanassios G.; Sur, Mriganka (1996-01-18)
    Integration of inputs by cortical neurons provides the basis for the complex information processing performed in the cerebral cortex. Here, we propose a new analytic framework for understanding integration within ...
  • Beymer, David (1995-09-01)
    The correspondence problem in computer vision is basically a matching task between two or more sets of features. In this paper, we introduce a vectorized image representation, which is a feature-based representation where ...
  • Sung, Kah-Kay (1992-01-01)
    Surface (Lambertain) color is a useful visual cue for analyzing material composition of scenes. This thesis adopts a signal processing approach to color vision. It represents color images as fields of 3D vectors, from ...
  • Abelson, Harold; diSessa, Andrea; Rudolph, Lee (1974-12-01)
    We develop a theory of orbits for the inverse-square central force law which differs considerably from the usual deductive approach. In particular, we make no explicit use of calculus. By beginning with qualitative ...
  • Jones, Douglas A.; Berwick, Robert C.; Cho, Franklin; Khan, Zeeshan; Kohl, Karen T.; Nomura, Naoyuki; Radhakrishnan, Anand; Sauerland, Ulrich; Ulicny, Brian (1996-05-06)
    In this report, we investigate the relationship between the semantic and syntactic properties of verbs. Our work is based on the English Verb Classes and Alternations of (Levin, 1993). We explore how these classes are ...
  • Lepinski, Matt; Micali, Silvio; Izmalkov, Sergei (2007-12-05)
    We put forward the notion of a verifiably secure device, in essence a stronger notion of secure computation, and achieve it in the ballot-box model. Verifiably secure devices1. Provide a perfect solution to the problem of ...
  • Kim, Deokhwan; Rinard, Martin C. (2010-12-03)
    Commuting operations play a critical role in many parallel computing systems. We present a new technique for verifying commutativity conditions, which are logical formulas that characterize when operations commute. Because ...
  • Carbin, Michael; Misailovic, Sasa; Rinard, Martin (2013-06-19)
    Emerging high-performance architectures are anticipated to contain unreliable components that may exhibit soft errors, which silently corrupt the results of computations. Full detection and recovery from soft errors is ...
  • Feamster, Nick; Balakrishnan, Hari (2004-05-17)
    Several studies have shown that wide-area Internet routing is fragile, with failures occurring for a variety of reasons. Routing fragility is largely due to the flexible and powerful ways in which BGP can be configured to ...
  • Rabbah, Rodric M.; Bratt, Ian; Asanovic, Krste; Agarwal, Anant (2004-06-14)
    For the last several decades, computer architecture research has largely benefited from, and continues to be driven by ad-hoc benchmarking. Often the benchmarks are selected to represent workloads that architects believe ...
  • Nielsen, K.R.K.; Poggio, T. (1983-10-01)
    Most computational theories of stereopsis require a registration stage prior to stereo matching to reduce the matching to a one-dimensional search. Even after registration, it is critical that the stereo matching process ...
  • McDermott, Drew V. (1975-09-01)
    This paper describes the implementation of a typical data-base manaer for an A.I. language like Planner, Conniver, or QA4, and some proposed extensions for applications involving greater quantities of data than usual. ...
MIT-Mirage