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:

  • 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)
  • Kuncak, Viktor; Rinard, Martin (2004-10-25)
    Spatial conjunction is a powerful construct for reasoning about dynamically allocateddata structures, as well as concurrent, distributed and mobile computation. Whileresearchers have identified many uses of spatial ...
  • Jung, Jaeyeon; Milito, Rodolfo A.; Paxson, Vern (2006-11-10)
    We present two light-weight worm detection algorithms thatoffer significant advantages over fixed-threshold methods.The first algorithm, RBS (rate-based sequential hypothesis testing)aims at the large class of worms that ...
  • Kuncak, Viktor; Rinard, Martin (2003-08-22)
    Shape analysis is a promising technique for statically verifyingand extracting properties of programs that manipulatecomplex data structures. We introduce a new characterizationof constraints that arise in parametric ...
  • Barton, G. Edward, Jr. (1984-12-01)
    Recent linguistic theories cast surface complexity as the result of interacting subsystems of constraints. For instance, the ID/LP grammar formalism separates constraints on immediate dominance from those on linear ...
  • Jaakkola, Tommi; Jordan, Michael I.; Singh, Satinder P. (1993-08-01)
    Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms, including the TD(lambda) algorithm of Sutton ...
  • 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 ...
MIT-Mirage