Advanced Search
DSpace@MIT

Browsing AI Memos (1959 - 2004) by Issue Date

Research and Teaching Output of the MIT Community

Browsing AI Memos (1959 - 2004) by Issue Date

Sort by: Order: Results:

  • Badoiu, Mihai; Indyk, Piotr; Sidiropoulos, Anastasios (2004-07-05)
    We present a constant-factor approximation algorithm for computing an embedding of the shortest path metric of an unweighted graph into a tree, that minimizes the multiplicative distortion.
  • Indyk, Piotr; Woodruff, David (2004-07-02)
    We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data stream for any real k>2. Together with known lower bounds, this resolves the main problem left open by Alon, Matias, ...
  • Torralba, Antonio; Murphy, Kevin P.; Freeman, William T. (2004-06-25)
    We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which uses Boosting to learn the graph structure and local ...
  • Teevan, Jaime (2004-06-18)
    This paper investigates how people return to information in a dynamic information environment. For example, a person might want to return to Web content via a link encountered earlier on a Web page, only to learn that the ...
  • 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 ...
  • Yokono, Jerry Jun; Poggio, Tomaso (2004-04-27)
    Local descriptors are increasingly used for the task of object recognition because of their perceived robustness with respect to occlusions and to global geometrical deformations. Such a descriptor--based on a set of ...
  • Torralba, Antonio (2004-04-14)
    This article describes a model for including scene/context priors in attention guidance. In the proposed scheme, visual context information can be available early in the visual processing chain, in order to modulate the ...
  • Torralba, Antonio; Murphy, Kevin P.; Freeman, William T. (2004-04-14)
    We consider the problem of detecting a large number of different classes of objects in cluttered scenes. Traditional approaches require applying a battery of different classifiers to the image, at multiple locations and ...
  • Yokono, Jerry Jun; Poggio, Tomaso (2004-03-24)
    Local descriptors are increasingly used for the task of object recognition because of their perceived robustness with respect to occlusions and to global geometrical deformations. We propose a performance criterion for a ...
  • Riesenhuber; Jarudi; Gilad; Sinha (2004-03-05)
    Understanding how the human visual system recognizes objects is one of the key challenges in neuroscience. Inspired by a large body of physiological evidence (Felleman and Van Essen, 1991; Hubel and Wiesel, 1962; Livingstone ...
  • Shrobe, Howard; Laddaga, Robert (2004-02-09)
    Traditionally, we've focussed on the question of how to make a system easy to code the first time, or perhaps on how to ease the system's continued evolution. But if we look at life cycle costs, then we must conclude ...
  • Grauman, Kristen; Shakhnarovich, Gregory; Darrell, Trevor (2004-01-28)
    Recovering a volumetric model of a person, car, or other object of interest from a single snapshot would be useful for many computer graphics applications. 3D model estimation in general is hard, and currently requires ...
  • Wolf, Lior; Amnon Shashua,; Mukherjee, Sayan (2004-01-27)
    Array technologies have made it possible to record simultaneously the expression pattern of thousands of genes. A fundamental problem in the analysis of gene expression data is the identification of highly relevant genes ...
  • Rakhlin, Alexander; Panchenko, Dmitry; Mukherjee, Sayan (2004-01-27)
    In this paper we focus on the problem of estimating a bounded density using a finite combination of densities from a given class. We consider the Maximum Likelihood Procedure (MLE) and the greedy procedure described by ...
  • Schneider, Robert; Riesenhuber, Maximilian (2004-01-14)
    Numerous psychophysical experiments have shown an important role for attentional modulations in vision. Behaviorally, allocation of attention can improve performance in object detection and recognition tasks. At the neural ...
  • Beal, Jacob; Gilbert, Seth (2003-12-17)
    We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...
  • Grauman, Kristen; Darrell, Trevor (2003-12-05)
    Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost of matching features from one shape to the features ...
  • Chang, Yu-Han; Ho, Tracey; Kaelbling, Leslie Pack (2003-12-04)
    Research in mobile ad-hoc networks has focused on situations in which nodes have no control over their movements. We investigate an important but overlooked domain in which nodes do have control over their movements. ...
  • Morgenstern, Christian; Heisele, Bernd (2003-11-28)
    We present a component-based approach for recognizing objects under large pose changes. From a set of training images of a given object we extract a large number of components which are clustered based on the similarity ...
  • Eisenstein, Jacob (2003-10-28)
    In this paper, I describe the application of genetic programming to evolve a controller for a robotic tank in a simulated environment. The purpose is to explore how genetic techniques can best be applied to produce ...
MIT-Mirage