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:

  • Minsky, Marvin (1967-09-01)
    A brief introduction to use of projecting coordinates for hand-eye position computations. Some standard theorems. Appendix A reproduces parts of Roberts' thesis concerning homogenous coordinated and matching of perspectively ...
  • Morency, Louis-Philippe (2003-05-01)
    In this text, we present two stereo-based head tracking techniques along with a fast 3D model acquisition system. The first tracking technique is a robust implementation of stereo-based head tracking designed for ...
  • Braunegg, David J. (1989-09-01)
    This paper describes a new method for matching, validating, and disambiguating features for stereo vision. It is based on the Marr-Poggio- Grimson stereo matching algorithm which uses zero-crossing contours in ...
  • Edelman, Shimon; Bulthoff, Heinrich; Weinshall, Daphna (1989-07-01)
    We describe a psychophysical investigation of the effects of object complexity and familiarity on the variation of recognition time and recognition accuracy over different views of novel 3D objects. Our findings indicate ...
  • Knoblich, Ulf; Riesenhuber, Maximilan (2002-03-15)
    Tsunoda et al. (2001) recently studied the nature of object representation in monkey inferotemporal cortex using a combination of optical imaging and extracellular recordings. In particular, they examined IT neuron ...
  • Nikolova, Evdokia (2008-09-13)
    We consider general combinatorial optimization problems that can be formulated as minimizing the weight of a feasible solution wT x over an arbitrary feasible set. For these problems we describe a broad class of corresponding ...
  • Tenenbaum, Joshua B.; Jonas, Eric M.; Mansinghka, Vikash K. (2008-11-24)
    We introduce combinational stochastic logic, an abstraction that generalizes deterministic digital circuit design (based on Boolean logic gates) to the probabilistic setting. We show how this logic can be combined with ...
  • Markowitz, Sidney (MIT Artificial Intelligence Laboratory, 1972-06)
    A short description of LISP functions that have been written for use with the stored picture facility. These functions allow one to display an image of a stored scene on the 340 scope, and produce graphs and histograms of ...
  • McDonald, David D. (MIT Artificial Intelligence Laboratory, 1978-06)
    This paper is written for an Area Examination on the three papers: "A Framed PAINTING: The Representation of a Common Sense Knowledge Fragment" by Eugene Charniak, "Reporter: An Intelligent Noticer" by Steve Rosenberg, and ...
  • STRING 
    Samson, Peter (1967-09-01)
    This document describes the STRING programming language which has been implemented on the MAC Artificial Group's PDP-6 computer. In the STRING system, all objects--constants, variables, functions and programs--are ...
  • Bobrow, Daniel G. (1964-07-01)
    String manipulation can be made convenient within the *** language by implementing two functions: 1) match [workspace; pattern] and 2) construct {format;pmatch]. In this memo I describe how I think these two functions can ...
  • Mansour, Hormoz (1983-11-01)
    There are multiple sorts of reasoning by analogy between two domains; the one with which we are concerned is a type of contextual analogy. The purpose of this paper is to see whether two domains that look analogous ...
  • Reynoso, Alfonso Garcia (1985-10-01)
    Methods are developed for predicting vibration response characteristics of systems which change configuration during operation. A cartesian robot, an example of such a position-dependent system, served as a test case ...
  • Ullman, Shimon; Sha'ashua, Amnon (1988-07-01)
    Certain salient structures in images attract our immediate attention without requiring a systematic scan. We present a method for computing saliency by a simple iterative scheme, using a uniform network of locally ...
  • Abelson, Harold; Sussman, Gerald Jay (1983-07-01)
    "The Structure and Interpretation of Computer Programs" is the entry-level subject in Computer Science at the Massachusetts Institute of Technology. It is required of all students at MIT who major in Electrical ...
  • Gabriel, Richard P. (MIT Artificial Intelligence Laboratory, 1973-08)
    A descriptive formalism along with a philosophy for its use and expansion are presented wherein descriptions are of a highly structured nature. This descriptive system and the method of recognition are extended to the ...
  • Miller, Mark L.; Goldstein, Ira P. (MIT Artificial Intelligence Laboratory, 1976-06-08)
    A structured approach to planning and debugging is obtained by using an Augmented Transition Network (ATN) to model the problem solving process. This proves to be a perspicuous representation for planning concepts including ...
  • Goldstein, Ira P.; Miller, Mark L. (1976-12-01)
    A unified theory of planning an debugging is explored by designing a problem solving program called PATN. PATN uses an augmented transition network (ATN) to represent a broad range of planning techniques, including ...
  • Richards, Whitman (1983-09-01)
    Stereopsis and motion parallax are two methods for recovering three dimensional shape. Theoretical analyses of each method show that neither alone can recover rigid 3D shapes correctly unless other information, such ...
  • Michener, Edwina Rissland (1978-08-01)
    This report develops a conceptual framework in which to talk about mathematical knowledge. There are several broad categories of mathematical knowledge: results which contain the traditional logical aspects of ...
MIT-Mirage