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:

  • 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 ...
  • 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 ...
  • Steck, Harald; Jaakkola, Tommi S. (2002-09-01)
    A common objective in learning a model from data is to recover its network structure, while the model parameters are of minor interest. For example, we may wish to recover regulatory networks from high-throughput data ...
  • Khan, Muhammad Taimoor; Serpanos, Dimitrios; Shrobe, Howard (2015-03-03)
    The purpose of this work is two fold: on one hand we want to formalize the behavior of critical components of the self generating and adapting cognitive middleware AWDRAT such that the formalism not only helps to understand ...
  • Hajiaghayi, MohammadTaghi; Leighton, F. Thomson (2003-07-05)
    We give a pure combinatorial problem whose solution determines max-flow min-cut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of ...
  • Pontil, Massimiliano; Mukherjee, Sayan; Girosi, Federico (1998-10-01)
    Support Vector Machines Regression (SVMR) is a regression technique which has been recently introduced by V. Vapnik and his collaborators (Vapnik, 1995; Vapnik, Golowich and Smola, 1996). In SVMR the goodness of fit ...
  • Logothetis, N.K.; Leopold, D.A. (1995-11-01)
    Binocular rivalry refers to the alternating perceptions experienced when two dissimilar patterns are stereoscopically viewed. To study the neural mechanism that underlies such competitive interactions, single cells were ...
MIT-Mirage