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:

  • Rieger, Chuck (MIT Artificial Intelligence Laboratory, 1975-11)
    Plan synthesis and language comprehension, or more generally, the act of discovering how one perception relates to others, are two sides of the same coin, because they both rely on a knowledge of cause and effect - algorithmic ...
  • Woo, Grace; Katabi, Dina; Chachulski, Szymon (2008-10-18)
    The fundamental problem of wireless video multicast is to scalably serve multiple receivers which may have very different channel characteristics. Ideally, one would like to broadcast a single stream that allows each ...
  • Wies, Thomas; Kuncak, Viktor; Lam, Patrick; Podelski, Andreas; Rinard, Martin (2005-11-03)
    We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints ...
  • Kuncak, Viktor; Rinard, Martin (2004-04-06)
    We have previously introduced role logic as a notation fordescribing properties of relational structures in shapeanalysis, databases and knowledge bases. A natural fragmentof role logic corresponds to two-variable logic ...
  • Wildes, Richard P. (1989-02-01)
    The problems under consideration center around the interpretation of binocular stereo disparity. In particular, the goal is to establish a set of mappings from stereo disparity to corresponding three-dimensional scene ...
  • diSessa, Andrea A. (1977-09-01)
    The computational metaphor which proposes the comparison of processes of mind to realizable or imaginable computer activities suggests a number of educational concerns. This paper discusses some of those concerns ...
  • Horn, Berthold K.P. (1973-10-01)
    The intensity at a point in an image is the product of the reflectance at the corresponding object point and the intensity of illumination at that point. We are able to perceive lightness, a quantity closely correlated ...
  • Monteleoni, Claire; Kaariainen, Matti (2007-01-23)
    We compare the practical performance of several recently proposed algorithms for active learning in the online setting. We consider two algorithms (and their combined variants) that are strongly online, in that they do ...
  • Monteleoni, Claire (2003-06-12)
    We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. The performance of each expert may change over time in a manner unknown to the learner. We formulate ...
  • Monteleoni, Claire; Jaakkola, Tommi (2005-11-17)
    We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a class of universal learning algorithms involving ...
  • Lam, Patrick; Kuncak, Viktor; Rinard, Martin (2003-12-18)
    We present a technique that enables the focused applicationof multiple analyses to different modules in the same program. Our researchhas two goals: 1) to address the scalability limitations of preciseanalyses by focusing ...
  • Erdmann, Michael Andreas (1984-08-01)
    Robots must successfully plan and execute tasks in the presence of uncertainty. Uncertainty arises from errors in modeling, sensing, and control. Planning in the presence of uncertainty constitutes one facet of the ...
  • Erdmann, Michael; Lozano-Perez, Tomas (1986-05-01)
    This paper explores the motion planning problem for multiple moving objects. The approach taken consists of assigning priorities to the objects, then planning motions one object at a time. For each moving object, the ...
  • Chow, C.K. (1969-04-01)
    The performance of a pattern recognition system is characterized by its error and reject tradeoff. This paper describes an optimum rejection rule and presents a general relation between the error and reject probabilities ...
  • Lam, Patrick; Kuncak, Viktor; Rinard, Martin (2004-10-04)
    We present a technique that enables the focused applicationof multiple analyses to di erent modules in thesame program. In our approach, each module encapsulatesone or more data structures and uses membershipin abstract ...
  • Erdmann, Michael A. (1989-08-01)
    Robots must act purposefully and successfully in an uncertain world. Sensory information is inaccurate or noisy, actions may have a range of effects, and the robot's environment is only partially and imprecisely ...
  • Perez, Alejandro (2013-11-18)
    We present a sampling-based algorithm that generates a set of locally-optimal paths that differ in visibility.
  • Kuncak, Viktor; Jackson, Daniel (2005-04-05)
    We present a technique that enables the use of finite modelfinding to check the satisfiability of certain formulaswhose intended models are infinite. Such formulas arisewhen using the language of sets and relations to ...
  • Kuncak, Viktor; Rinard, Martin (2003-10-24)
    We present role logic, a notation for describing propertiesof relational structures in shape analysis, databases, andknowledge bases. We construct role logic using the ideas ofde Bruijn's notation for lambda calculus, an ...
  • Pfister, Gregory F. (MIT Artificial Intelligence Laboratory, 1973-03-29)
MIT-Mirage