Advanced Search
DSpace@MIT

Browsing AI Memos (1959 - 2004) by Title

Research and Teaching Output of the MIT Community

Browsing AI Memos (1959 - 2004) by Title

Sort by: Order: Results:

  • McDermott, Drew; Doyle, Jon (1978-08-01)
    "Non-monotonic" logical systems are logics in which the introduction of new axioms can invalidate old theorems. Such logics are very important in modeling the beliefs of active processes which, acting in the presence ...
  • McDermott, Drew; Doyle, John (1979-01-01)
    "Non-monotonic" logical systems are logics in which the introduction of new axioms can invalidate old theorems. Such logics are very important in modeling the beliefs of active processes which, acting in the presence ...
  • Hutchinson, James M.; Lo, Andrew; Poggio, Tomaso (1994-04-01)
    We propose a nonparametric method for estimating derivative financial asset pricing formulae using learning networks. To demonstrate feasibility, we first simulate Black-Scholes option prices and show that learning ...
  • Sudderth, Erik B.; Ihler, Alexander T.; Freeman, William T.; Willsky, Alan S. (2002-12-01)
    In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There exist inference algorithms for discrete ...
  • Jasinschi, Rado; Yuille, Alan (1987-11-01)
    We study the problem of recovering the structure from motion of figures which are allowed to perform a controlled non-rigid motion. We use Regge Calculus to approximate a general surface by a net of triangles. The ...
  • Niyogi, Partha; Berwick, Robert C. (1995-03-01)
    In Phys. Rev. Letters (73:2), Mantegna et al. conclude on the basis of Zipf rank frequency data that noncoding DNA sequence regions are more like natural languages than coding regions. We argue on the contrary that an ...
  • Riesenhuber, Maximilian; Poggio, Tomaso (1999-12-17)
    We present a novel scheme ("Categorical Basis Functions", CBF) for object class representation in the brain and contrast it to the "Chorus of Prototypes" scheme recently proposed by Edelman. The power and flexibility ...
  • Rifkin, Ryan; Pontil, Massimiliano; Verri, Alessandro (1999-08-11)
    When training Support Vector Machines (SVMs) over non-separable data sets, one sets the threshold $b$ using any dual cost coefficient that is strictly between the bounds of $0$ and $C$. We show that there exist SVM ...
  • Marr, David (1974-12-01)
    The goals of the computation that extracts disparity from pairs of pictures of a scene are defined, and the contraints imposed upon that computation by the three-dimensional structure of the world are determined. ...
  • Evgeniou, Theodoros; Pontil, Massimiliano (2000-05-01)
    We present distribution independent bounds on the generalization misclassification performance of a family of kernel classifiers with margin. Support Vector Machine classifiers (SVM) stem out of this class of machines. The ...
  • Poggio, Tomaso; Girosi, Federico (1998-05-01)
    We derive a new representation for a function as a linear combination of local correlation kernels at optimal sparse locations and discuss its relation to PCA, regularization, sparsity principles and Support Vector Machines. ...
  • Poggio, Tomaso; Brunelli, Roberto (1992-02-01)
    sWe show that we can optimally represent the set of 2D images producedsby the point features of a rigid 3D model as two lines in twoshigh-dimensional spaces. We then decribe a working recognition systemsin which we represent ...
  • Goldstein, Ira P.; Roberts, R. Bruce (1977-02-01)
    Traditional scheduling algorithms (using the techniques of PERT charts, decision analysis or operations research) require well-defined quantitative, complete sets of constraints. They are insufficient for scheduling ...
  • Sussman, Gerald Jay; Wisdom, Jack (1988-04-01)
    The Digital Orrery has been used to perform an integration of the motion of the outer planets for 845 million years. This integration indicates that the long-term motion of the planet Pluto is chaotic. Nearby trajectories ...
  • Ikeuchi; Katsushi (1979-11-01)
    An iterative method of using occluding boundary information is proposed to compute surface slope from shading. We use a stereographic space rather than the more commonly used gradient space in order to express occluding ...
  • Shah, Jayant M. (1968-04-01)
    A numerical method for solving linear, two-dimensional elliptic boundary value problems is presented. The method is essentially the Ritz procedure which uses; polynomial spline functions to approximate the exact solution. ...
  • Mohan, Anuj (1999-08-11)
    In this paper we present a component based person detection system that is capable of detecting frontal, rear and near side views of people, and partially occluded persons in cluttered scenes. The framework that is ...
  • Monegan, Michael D. (1989-04-01)
    The Object-oriented Reuse Tool (ORT) supports the reuse of object-oriented software by maintaining a library of reusable classes and recording information about their reusability as well as information associated with their ...
  • Nagao, Kanji; Grimson W. Eric L. (1994-02-01)
    In order to recognize an object in an image, we must determine the best transformation from object model to the image. In this paper, we show that for features from coplanar surfaces which undergo linear transformations ...
  • McAllester, David (1991-12-01)
    It is obvious to anyone familiar with the rules of the game of chess that a king on an empty board can reach every square. It is true, but not obvious, that a knight can reach every square. Why is the first fact obvious ...
MIT-Mirage