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 (1968-01-01)
    Presented here is part of the graduate work that I am doing in the much broader area of protocol analysis (see A.I. memo 137). The goal of the function abstraction is to find a procedure that satisfies a given set of ...
  • Sussman, Gerald Jay; Wisdom, Jack (2005-02-02)
    Differential geometry is deceptively simple. It is surprisingly easyto get the right answer with unclear and informal symbol manipulation.To address this problem we use computer programs to communicate aprecise understanding ...
  • Moses, Joel (1970-06-01)
    A problem common to many powerful programming languages arises when one has to determine what values to assign to free variables in functions. Different implementational approaches which attempt to solve the problem are ...
  • Freiling, Michael J. (MIT Artificial Intelligence Laboratory, 1973-12)
    This paper discusses methods for enhancing the learning abilities of the Winston program, first by representing functional properties of the objects considered, and secondly by embedding individual models in a hierarchically ...
  • Horn, Berthold K.P. (MIT Artificial Intelligence Laboratory, 1975-12)
    Details of the kinematics, statics, and dynamics of a particularly simple form of locomotory system are developed to demonstrate the importance of understanding the behavior of the mechanical system interposed between the ...
  • Fukumori, Koji (1980-09-01)
    Traditionally, the compilation of long-term timetables for high-density rail service with multiple classes of trains on the same track is a job for expert people, not computers. We propose an algorithm that uses the ...
  • Marill, Thomas (MIT Artificial Intelligence Laboratory, 1989-02)
    The problem of three-dimensional vision is generally formulated as the problem of recovering the three-dimensional scene that caused the image. We have previously presented a certain line-drawing and shown that it has the ...
  • Lee, Lily (2003-06-26)
    This thesis describes a representation of gait appearance for the purpose of person identification and classification. This gait representation is based on simple localized image features such as moments extracted from ...
  • Lee, Lily (2001-09-01)
    This paper describes a representation of the dynamics of human walking action for the purpose of person identification and classification by gait appearance. Our gait representation is based on simple features such as ...
  • Bishop, Peter B. (MIT Artificial Intelligence Laboratory, 1975-09)
    The address space is broken into areas that can be garbage collected separately. An area is analogous to a file on current systems. Each process has a local computation area for its stack and temporary storage that is ...
  • Miller, James S.; Rozas, Guillermo J. (1994-03-01)
    Prompted by claims that garbage collection can outperform stack allocation when sufficient physical memory is available, we present a careful analysis and set of cross-architecture measurements comparing these two approaches ...
  • Kagal, Lalana; Jacobi, Ian; Khandelwal, Ankesh (2011-04-16)
    The Semantic Web is a distributed model for publishing, utilizing and extending structured information using Web protocols. One of the main goals of this technology is to automate the retrieval and integration of data and ...
  • Gharbi, Michael; Malisiewicz, Tomasz; Paris, Sylvain; Durand, Frédo (2012-10-01)
    We introduce a fast technique for the robust computation of image similarity. It builds on a re-interpretation of the recent exemplar-based SVM approach, where a linear SVM is trained at a query point and distance is ...
  • Taft, Rebecca; Vartak, Manasi; Satish, Nadathur Rajagopalan; Sundaram, Narayanan; Madden, Samuel; Stonebraker, Michael (2013-11-19)
    This paper introduces a new benchmark, designed to test database management system (DBMS) performance on a mix of data management tasks (joins, filters, etc.) and complex analytics (regression, singular value decomposition, ...
  • Bouvrie, Jake; Poggio, Tomaso; Rosasco, Lorenzo; Smale, Steve; Wibisono, Andre (2010-11-19)
    Hierarchical learning algorithms have enjoyed tremendous growth in recent years, with many new algorithms being proposed and applied to a wide range of applications. However, despite the apparent success of hierarchical ...
  • Chen, Jing (2008-05-01)
    Micali and Valiant proposed a mechanism for combinatorial auctions that is dominant-strategy truthful, guarantees reasonably high revenue, and is very resilient against collusions. Their mechanism, however, uses as a ...
  • Riesenhuber, Maximilian (2001-12-10)
    Baylis & Driver (Nature Neuroscience, 2001) have recently presented data on the response of neurons in macaque inferotemporal cortex (IT) to various stimulus transformations. They report that neurons can generalize over ...
  • Li, Hui X. (2005-05-20)
    Conflict-directed search algorithms have formed the core of practical, model-based reasoning systems for the last three decades. In many of these applications there is a series of discrete constraint optimization problems ...
  • Srebro, Nathan; Jaakkola, Tommi (2003-01-15)
    We study the frequent problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving {\\em weighted} low rank approximation problems, which, unlike simple ...
  • Yuille, A.L.; Poggio, T. (1984-05-01)
    The ordering constraint along epipolar lines is a powerful constraint that has been exploited by some recent stereomatching algorithms. We formulate a generalized ordering constraint, not restricted to epipolar lines. ...
MIT-Mirage