Advanced Search
DSpace@MIT

Browsing AI Memos (1959 - 2004) by Title

Research and Teaching Output of the MIT Community

Planned maintenance alert - Monday, April 21: DSpace@MIT will undergo maintenance activities that will affect service availability and access to file content. While the service interruptions should be brief, access to file content may take longer to restore. Status updates will be posted to http://3down.mit.edu/.

Browsing AI Memos (1959 - 2004) by Title

Sort by: Order: Results:

  • Marr, D. (1975-12-01)
    The article describes a symbolic approach to visual information processing, and sets out four principles that appear to govern the design of complex symbolic information processing systems. A computational theory of ...
  • Desai, Ujjaval Y.; Mizuki, Marcelo M.; Masaki, Ichiro; Horn, Berthold K.P. (1996-11-01)
    In this paper, we present a static image compression algorithm for very low bit rate applications. The algorithm reduces spatial redundancy present in images by extracting and encoding edge and mean information. Since ...
  • Hildreth, Ellen C. (1985-09-01)
    The goal of vision is to recover physical properties of objects in a scene, such as the location of object boundaries and the structure, color, and texture of object surfaces, from the two-dimensional image that is ...
  • Grimson, W. Eric L. (1990-04-01)
    Many current recognition systems use constrained search to locate objects in cluttered environments. Previous formal analysis has shown that the expected amount of search is quadratic in the number of model and data features, ...
  • Fischer, Michael J. (1972-04-01)
    This paper was first presented at the Symposium on Complexity of Computer Computations, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, on March 22, 1972. The equivalence problem is to determine the ...
  • Breuel, Thomas M. (1990-10-01)
    A polynomial time algorithm (pruned correspondence search, PCS) with good average case performance for solving a wide class of geometric maximal matching problems, including the problem of recognizing 3D objects from ...
  • Sussman, Gerald Jay (1977-06-01)
    This report outlines the problem of intelligent failure recovery in a problem-solver for electrical design. We want our problem solver to learn as much as it can from its mistakes. Thus we cast the engineering design ...
  • Chan, Nicholas Tung; Shelton, Christian (2001-04-17)
    This paper presents an adaptive learning model for market-making under the reinforcement learning framework. Reinforcement learning is a learning technique in which agents aim to maximize the long-term accumulated rewards. ...
  • Goldstein, Ira (1973-04-01)
    An elementary theorem prover for a small part of plane Euclidean geometry is presented. The purpose is to illustrate important problem solving concepts that naturally arise in building procedural models for mathematics.
  • Stallman, Richard M. (1981-10-01)
    A reference manual for the extensible, customizable, self-documenting real-time display editor. This manual corresponds to EMACS version 162.
  • Stallman, Richard M. (1983-03-01)
    A reference manual for the extensible, customizable, self-documenting real-time display editor. This manual corresponds to EMACS version 162.
  • Stallman, Richard M. (1981-03-01)
    EMACS is a display editor which is implemented in an interpreted high level language. This allows users to extend the editor by replacing parts of it, to experiment with alternative command languages, and to share ...
  • Alvira, Mariano; Rifkin, Ryan (2001-01-01)
    Impressive claims have been made for the performance of the SNoW algorithm on face detection tasks by Yang et. al. [7]. In particular, by looking at both their results and those of Heisele et. al. [3], one could infer that ...
  • Yuille, Alan (1987-11-01)
    This paper describes attempts to model the modules of early vision in terms of minimizing energy functions, in particular energy functions allowing discontinuities in the solution. It examines the success of using ...
  • Richards, W.A.; Rubin, J.M.; Hoffman, D.D. (1981-06-01)
    Many problems in biological information processing require the solution to a complex system of equations in many unknown variables. An equation-counting procedure is described for determining whether such a system of ...
  • Girosi, Federico (1997-05-01)
    In the first part of this paper we show a similarity between the principle of Structural Risk Minimization Principle (SRM) (Vapnik, 1982) and the idea of Sparse Approximation, as defined in (Chen, Donoho and Saunders, ...
  • Paterson, Michael Stewart (1967-08-01)
    A central problem in the mathematical teory of computers and computation is to find a suitable framework for expressing the ececution of a computer program by a computer. Within the framework we want to be alble to provide ...
  • Martin, Martin C. (2003-05-01)
    This paper presents a novel algorithm for learning in a class of stochastic Markov decision processes (MDPs) with continuous state and action spaces that trades speed for accuracy. A transform of the stochastic MDP ...
  • Meila, Marina; Jordan, Michael I.; Morris, Quaid (1998-09-01)
    This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EM and the Minimum Spanning ...
  • Meila, Marina; Jordan, Michael I.; Morris, Quaid (1997-06-01)
    This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EMand the Minimum Spanning ...
MIT-Mirage