Advanced Search
DSpace@MIT

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Research and Teaching Output of the MIT Community

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Sort by: Order: Results:

  • Gardiol, Natalia H.; Kaelbling, Leslie Pack (2006-03-20)
    In order for autonomous artificial decision-makers to solverealistic tasks, they need to deal with the dual problems of searching throughlarge state and action spaces under time pressure.We study the problem of planning ...
  • Zhou, You (2009-04-16)
    Network coordinate systems allow for efficient construction of large-scale distributed systems on the Internet. Coordinates provide locality information in a compact way, without requiring each node to contact every potential ...
  • Jackson, Daniel (2013-08-08)
    A research agenda in software design is outlined, focusing on the role of concepts. The notions of concepts as "abstract affordances" and of conceptual integrity are discussed, and a series of small examples of conceptual ...
  • Taycher, Leonid; Shakhnarovich, Gregory; Demirdjian, David; Darrell, Trevor (2005-12-01)
    We describe a state-space tracking approach based on a Conditional Random Field(CRF) model, where the observation potentials are \emph{learned} from data. Wefind functions that embed both state and observation into a space ...
  • Lynch, Nancy; Sastry, Srikanth (2015-03-02)
    The FLP result shows that crash-tolerant consensus is impossible to solve in asynchronous systems, and several solutions have been proposed for crash-tolerant consensus under alternative (stronger) models. One popular ...
  • Azar, Pablo; Chen, Jing; Micali, Silvio (2010-12-20)
    Classical Bayesian mechanism design is "centralized," that is, the designer is assumed to know the distribution D from which the players' type profile has been drawn. We instead investigate a very "decentralized" Bayesian ...
  • Azar, Pablo; Chen, Jing; Micali, Silvio (2010-09-08)
    We put forward a new class of mechanisms. In this extended abstract, we exemplify our approach only for single-good auctions in what we call a conservative-Bayesian setting. (Essentially, no common-knowledge about the ...
  • Chen, Jing; Micali, Silvio (2010-12-20)
    In mechanism design, the traditional way of modeling the players' incomplete information about their opponents is "assuming a Bayesian." This assumption, however, is very strong and does not hold in many real applications. ...
  • Beal, Jacob; Bachrach, Jonathan; Tobenkin, Mark (2007-08-24)
    Long-lived sensor network applications must be able to self-repair and adapt to changing demands. We introduce a new approach for doing so: Constraint and Restoring Force. CRF is a physics-inspired framework for computing ...
  • Rose, Eva (2014-10-01)
    Our goal is to present a completed, semantic formalization of the Jeeves privacy language evaluation engine, based on the original Jeeves constraint semantics defined by Yang et al at POPL12, but sufficiently strong to ...
  • Werfel, Justin; Bar-Yam, Yaneer; Nagpal, Radhika (2005-04-08)
    We describe a system in which simple, identical, autonomous robots assemble two-dimensional structures out of identical building blocks. We show that, in a system divided in this way into mobile units and structural units, ...
  • Morency, Louis-Philippe (2006-11-15)
    During face-to-face conversation, people use visual feedback (e.g.,head and eye gesture) to communicate relevant information and tosynchronize rhythm between participants. When recognizing visualfeedback, people often rely ...
  • Torralba, Antonio (2004-04-14)
    This article describes a model for including scene/context priors in attention guidance. In the proposed scheme, visual context information can be available early in the visual processing chain, in order to modulate the ...
  • Torralba, Antonio; Murphy, Kevin P.; Freeman, William T. (2004-06-25)
    We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which uses Boosting to learn the graph structure and ...
  • Bachrach, Jonathan; Beal, Jacob; Fujiwara, Takeshi (2007-07)
    A spatial computer is a collection of devices filling spacewhose ability to interact is strongly dependent on theirproximity. Previously, we have showed that programmingsuch a computer as a continuous space can allow ...
  • Blackmore, Lars; Block, Steve (2006-02-28)
    The objective of this project is to achieve reliable transfer of an object from one robotic manipulator to another. This capability is useful for a number of applications, for instance robotic assembly, or robots with ...
  • Donovan, Alan; Kiezun, Adam; Tschantz, Matthew S.; Ernst, Michael D. (2004-03-30)
    Java 1.5 will include a type system (called JSR-14) that supports parametric polymorphism, or generic classes. This will bring many benefits to Java programmers, not least because current Java practice makes heavy use of ...
  • Leaute, Thomas (2006-04-28)
    Agile autonomous systems are emerging, such as unmanned aerial vehicles (UAVs), that must robustly perform tightly coordinated time-critical missions; for example, military surveillance or search-and-rescue scenarios. In ...
  • Agarwal, Anant; Miller, Jason; Beckmann, Nathan; Wentzlaff, David (2010-02-11)
    The number of cores which fit on a single chip is growing at an exponential rate while off-chip main memory bandwidth is growing at a linear rate at best. This core count to off-chip bandwidth disparity causes per-core ...
  • Lynch, Nancy; Kuhn, Fabian; Kowalski, Dariusz; Khabbazian, Majid (2010-02-09)
    We analyze greedy algorithms for broadcasting messages throughout a multi-hop wireless network, using a slot-based model that includes message collisions without collision detection. Our algorithms are split formally into ...
MIT-Mirage