Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Subject "AI"

Now showing items 81-100 of 275

  • Evaluation of sets of oriented and non-oriented receptive fields as local descriptors 

    Unknown author (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 ...

  • Evaluation of sets of oriented and non-oriented receptive fields as local descriptors 

    Unknown author (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 ...

  • Evolving Robocode Tank Fighters 

    Unknown author (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 controllers ...

  • Evolving Robocode Tank Fighters 

    Unknown author (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 ...

  • Exact Solution of the Nonlinear Dynamics of Recurrent Neural Mechanisms for Direction Selectivity 

    Unknown author (2002-08-01)
    Different theoretical models have tried to investigate the feasibility of recurrent neural mechanisms for achieving direction selectivity in the visual cortex. The mathematical analysis of such models has been restricted ...

  • Experimental Markets for Product Concepts 

    Unknown author (2001-07-01)
    Market prices are well known to efficiently collect and aggregate diverse information regarding the value of commodities and assets. The role of markets has been particularly suitable to pricing financial securities. This ...

  • Exploring Vision-Based Interfaces: How to Use Your Head in Dual Pointing Tasks 

    Unknown author (2002-01-01)
    The utility of vision-based face tracking for dual pointing tasks is evaluated. We first describe a 3-D face tracking technique based on real-time parametric motion-stereo, which is non-invasive, robust, and self-initialized. ...

  • Face processing in humans is compatible with a simple shape-based model of vision 

    Unknown author (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 ...

  • Face processing in humans is compatible with a simple shape-based model of vision 

    Unknown author (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 ...

  • Face Representation in Cortex: Studies Using a Simple and Not So Special Model 

    Unknown author (2003-06-05)
    The face inversion effect has been widely documented as an effect of the uniqueness of face processing. Using a computational model, we show that the face inversion effect is a byproduct of expertise with respect to the ...

  • Factorial Hidden Markov Models 

    Unknown author (1996-02-09)
    We present a framework for learning in hidden Markov models with distributed state representations. Within this framework, we derive a learning algorithm based on the Expectation--Maximization (EM) procedure for maximum ...

  • Fast Contour Matching Using Approximate Earth Mover's Distance 

    Unknown author (2003-12-05)
    Weighted graph matching is a good way to align a pair of shapesrepresented by a set of descriptive local features; the set ofcorrespondences produced by the minimum cost of matching features fromone shape to the features ...

  • Fast Contour Matching Using Approximate Earth Mover's Distance 

    Unknown author (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 ...

  • Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks 

    Unknown author (1996-02-09)
    Sigmoid type belief networks, a class of probabilistic neural networks, provide a natural framework for compactly representing probabilistic information in a variety of unsupervised and supervised learning problems. ...

  • Fast Pose Estimation with Parameter Sensitive Hashing 

    Unknown author (2003-04-18)
    Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensional problems such as pose estimation, ...

  • Fast Rates for Regularized Least-squares Algorithm 

    Unknown author (2005-04-14)
    We develop a theoretical analysis of generalization performances of regularized least-squares on reproducing kernel Hilbert spaces for supervised learning. We show that the concept of effective dimension of an integral ...

  • Feature Point Detection and Curve Approximation for Early Processing of Freehand Sketches 

    Unknown author (2001-05-01)
    Freehand sketching is both a natural and crucial part of design, yet is unsupported by current design automation software. We are working to combine the flexibility and ease of use of paper and pencil with the processing ...

  • Fluorescence Assay for Polymerase Arrival Rates 

    Unknown author (2003-08-31)
    To engineer complex synthetic biological systems will require modular design, assembly, and characterization strategies. The RNA polymerase arrival rate (PAR) is defined to be the rate that RNA polymerases arrive at a ...

  • Fluorescence Assay for Polymerase Arrival Rates 

    Unknown author (2003-08-31)
    To engineer complex synthetic biological systems will require modulardesign, assembly, and characterization strategies. The RNApolymerase arrival rate (PAR) is defined to be the rate that RNApolymerases arrive at a specified ...

  • Functional Differential Geometry 

    Unknown author (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 ...