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:

  • Rosenberg, Steven (1978-05-01)
    Most real world domains differ from the micro-worlds traditionally used in A.I. in that they have an incomplete factual database which changes over time. Understanding in these domains can be thought of as the generation ...
  • Rich, Charles; Shrobe, Howard E. (MIT Artificial Intelligence Laboratory, 1974-12)
    Several attempts have been made to produce tools which will help the programmer of complex computer systems. A new approach is proposed which integrates the programmer's intentions, the program code, and the comments, by ...
  • Waltz, David L. (MIT Artificial Intelligence Laboratory, 1971-11)
    The basic problem of this research is to find methods which will enable a program to construct a three dimensional interpretation from the line drawing of a scene, where the scene may have shadows and various degeneracies. ...
  • Goldstein, Ira P. (1974-04-01)
    What are the characteristics of the process by which an intent is transformed into a plan and then a program? How is a program debugged? This paper analyzes these questions in the context of understanding simple turtle ...
  • Kim, Philip Mjong-Hyon Shin (2003-02-05)
    Biological systems exhibit rich and complex behavior through the orchestrated interplay of a large array of components. It is hypothesized that separable subsystems with some degree of functional autonomy exist; deciphering ...
  • Tonfoni, Graziella; Doyle, Richard J. (1983-04-01)
    Understanding a text exactly in the way that the Text Producer meant the text to be understood is highly unlikely unless the text interpretation process is constrained. Specific understanding-directing criteria are ...
  • García, Rubén (2011-05-10)
    Supplemental materials for the master thesis "Understanding the Performance of Broadband Networks Through the Statistical Analysis of Speed Tests", by Rubén García, submitted in May 2011 for the S.M. in Technology and ...
  • Michener, Edwina Rissland (1978-08-01)
    In this paper we look at some of the ingredients and processes involved in the understanding of mathematics. We analyze elements of mathematical knowledge, organize them in a coherent way and take note of certain ...
  • Evgeniou, Theodoros; Pontil, Massimiliano; Poggio, Tomaso (1999-03-01)
    Regularization Networks and Support Vector Machines are techniques for solving certain problems of learning from examples -- in particular the regression problem of approximating a multivariate function from sparse ...
  • Modzelewski, Kevin; Miller, Jason; Belay, Adam; Beckmann, Nathan; Gruenwald, Charles, III; Wentzlaff, David; Youseff, Lamia; Agarwal, Anant (2009-11-20)
    Single chip processors with thousands of cores will be available in the next ten years and clouds of multicore processors afford the operating system designer thousands of cores today. Constructing operating systems for ...
  • Zollei, Lilla; Fisher, John; Wells, William (2004-04-28)
    We formulate and interpret several multi-modal registration methods in the context of a unified statistical and information theoretic framework. A unified interpretation clarifies the implicit assumptions of each method ...
  • Dorr, Bonnie Jean (1987-12-01)
    This report describes the UNITRAN (UNIversal TRANslator) system, an implementation of a principle-based approach to natural language translation. The system is "interlingual", i.e., the model is based on universal ...
  • Dorr, Bonnie Jean (1987-12-01)
    Machine translation has been a particularly difficult problem in the area of Natural Language Processing for over two decades. Early approaches to translation failed since interaction effects of complex phenomena in ...
  • Cooke, John; Minsky, Marvin (1963-04-01)
    In the following sections we show, by a simple direct construction, that computations done by Turing machines can be duplicated by a very simple symbol manipulation process. The process is described by a simple form of ...
  • Minsky, Marvin; Papert, Seymour (1964-11-01)
    When is a set A of positive integers, represented as binary numbers, "regular" in the sense that it is a set of sequences that can be recognized by a finite-state machine? Let pie A(n) be the number of members of A less ...
  • Marcken, Carl de (1996-01-18)
    We present an unsupervised learning algorithm that acquires a natural-language lexicon from raw speech. The algorithm is based on the optimal encoding of symbol sequences in an MDL framework, and uses a hierarchical ...
  • Christoudias, C. Mario; Urtasun, Raquel; Darrell, Trevor (2008-02-17)
    Object recognition accuracy can be improved when information frommultiple views is integrated, but information in each view can oftenbe highly redundant. We consider the problem of distributed objectrecognition or indexing ...
  • Liskov, Moses; Milcali, Silvio (2003-10-14)
    We build on the work of Micali, Rabin, and Killian [4] to introduce zero-knowledge sets and databases that may be updated in a desirable way. In particular, in order to make an update the owner of the set must publish a ...
  • Hart, Timothy (1965-11-01)
    This memo presupposes some acquaintance with "A Machine Oriented Logic Based on the Resolution Principle", J.A. Robinson, JACM Jan65. The reader unfamiliar with this paper should be able to get a general idea of the ...
  • Micali, Silvio (2009-06-15)
MIT-Mirage