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:

  • Miller, Erik G.; Tieu, Kinh; Stauffer, Chris P. (2001-09-01)
    We present a unifying framework in which "object-independent" modes of variation are learned from continuous-time data such as video sequences. These modes of variation can be used as "generators" to produce a manifold of ...
  • Ross, Michael G.; Kaelbling, Leslie Pack (2003-09-08)
    This memo describes the initial results of a project to create aself-supervised algorithm for learning object segmentation from videodata. Developmental psychology and computational experience havedemonstrated that the ...
  • Ross, Michael G.; Kaelbling, Leslie Pack (2003-09-08)
    This memo describes the initial results of a project to create a self-supervised algorithm for learning object segmentation from video data. Developmental psychology and computational experience have demonstrated that the ...
  • Winston, Patrick H.; Binford, Thomas O.; Katz, Boris; Lowry, Michael (1982-11-01)
    It is too hard to tell vision systems what things look like. It is easier to talk about purpose and what things are for. Consequently, we want vision systems to use functional descriptions to identify things when ...
  • Wang, Xiaogang; Tieu, Kinh; Grimson, Eric (2006-02-10)
    In this paper, we describe an unsupervised learning framework to segment a scene into semantic regions and to build semantic scene models from long-term observations of moving objects in the scene. First, we introduce two ...
  • Connell, Jonathan Hudson (1985-09-01)
    We present the results of an implemented system for learning structural prototypes from grey-scale images. We show how to divide an object into subparts and how to encode the properties of these subparts and the relations ...
  • Banerjee, Ashis Gopal; Roy, Nicholas (2010-09-18)
    In many optimization problems, similar linear programming (LP) problems occur in the nodes of the branch and bound trees that are used to solve integer (mixed or pure, deterministic or stochastic) programming problems. ...
  • Winston, Patrick H. (1970-09-01)
    The research here described centers on how a machine can recognize concepts and learn concepts to be recognized. Explanations are found in computer programs that build and manipulate abstract descriptions of scenes ...
  • Das, Sanmay (2005-10-07)
    This paper introduces algorithms for learning how to trade usinginsider (superior) information in Kyle's model of financial markets.Prior results in finance theory relied on the insider having perfectknowledge of the ...
  • Wolf, Lior (2006-05-16)
    In Quantum Mechanics the transition from a deterministic descriptionto a probabilistic one is done using a simple rule termed the Bornrule. This rule states that the probability of an outcome ($a$)given a state ($\Psi$) ...
  • Finney, Sarah; Gardiol, Natalia H.; Kaelbling, Leslie Pack; Oates, Tim (2002-04-10)
    Most reinforcement learning methods operate on propositional representations of the world state. Such representations are often intractably large and generalize poorly. Using a deictic representation is believed to be ...
  • Srebro, Nathan (2004-11-22)
    Matrices that can be factored into a product of two simpler matricescan serve as a useful and often natural model in the analysis oftabulated or high-dimensional data. Models based on matrixfactorization (Factor Analysis, ...
  • Monteleoni, Claire E. (2006-09-01)
    Many practical problems such as forecasting, real-time decisionmaking, streaming data applications, and resource-constrainedlearning, can be modeled as learning with online constraints. Thisthesis is concerned with analyzing ...
  • Bergman, Ruth (1995-05-05)
    This thesis examines the problem of an autonomous agent learning a causal world model of its environment. Previous approaches to learning causal world models have concentrated on environments that are too "easy" ...
  • Martin, William A. (1968-02-01)
    Determination of the minimum resources required to parse a language generated by a given context free grammar is an intriguing and yet unsolved problem. It seems plausible that any unambiguous context free grammar could ...
  • Stein, Gideon P. (1996-12-01)
    This paper describes a new method for lens distortion calibration using only point correspondences in multiple views, without the need to know either the 3D location of the points or the camera locations. The standard ...
  • Waters, Richard C. (1983-02-01)
    Many loops can be more easily understood and manipulated if they are viewed as being built up out of operations on sequences of values. A notation is introduced which makes this viewpoint explicit. Using it, loops can ...
  • Bullwinkle, Candace (1977-05-01)
    This paper presents a discussion of means of describing the discourse and its components which makes speech act interpretation and reference disambiguation possible with minimal search of the knowledge in the database. ...
  • Poggio, Tomaso (2012-05-31)
    I discuss the "levels of understanding" framework described in Marr's Vision and propose a revised and updated version of it to capture the changes in computation and neuroscience over the last 30 years.
  • Beal, Jacob (2003-03-17)
    In a Communication Bootstrapping system, peer components with different perceptual worlds invent symbols and syntax based on correlations between their percepts. I propose that Communication Bootstrapping can also be ...
MIT-Mirage