Advanced Search
DSpace@MIT

Browsing CSAIL Digital Archive by Title

Research and Teaching Output of the MIT Community

Browsing CSAIL Digital Archive by Title

Sort by: Order: Results:

  • Distributed Area Search with a Team of Robots 
    Tzanov, Velin K. (2006-12-05)
    The main goal of this thesis is to demonstrate the applicability of the distributed systems paradigm to robotic systems. This goal is accomplished by presenting two solutions to the Distributed Area Search problem: organizing ...
  • A Distributed Building Evacuation System 
    Qumsiyeh, Dany M. (2008-07-14)
    This thesis investigates the feasibility of a smart building evacuation system, capable of guiding occupants along safe paths to exits and responding to changing threats. Inspired by developments in amorphous computing, ...
  • Distributed Computation in Dynamic Networks 
    Oshman, Rotem; Lynch, Nancy; Kuhn, Fabian (2009-11-10)
    In this report we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen ...
  • Distributed Method Selection and Dispatching of Contingent, Temporally Flexible Plans 
    Block, Stephen (2007-03-05)
    Many applications of autonomous agents require groups to work in tight coordination. To be dependable, these groups must plan, carry out and adapt their activities in a way that is robust to failure and to uncertainty. ...
  • Distribution Volume Tracking on Privacy-Enhanced Wireless Grid 
    Uzuner, Ozlem (2004-07-25)
    In this paper, we discuss a wireless grid in which users are highly mobile, and form ad-hoc and sometimes short-lived connections with other devices. As they roam through networks, the users may choose to employ ...
  • DNA Binding and Games 
    Perez-Breva, Luis; Ortiz, Luis E.; Yeang, Chen-Hsiang, 1969-; Jaakkola, Tommi (2006-03-06)
    We propose a game-theoretic approach tolearn and predict coordinate binding of multiple DNA bindingregulators. The framework implements resource constrainedallocation of proteins to local neighborhoods as well as to ...
  • DSENT - A Tool Connecting Emerging Photonics with Electronics for Opto-Electronic Networks-on-Chip Modeling 
    Sun, Chen; Chen, Chia-Hsin Owen; Kurian, George; Wei, Lan; Miller, Jason; Agarwal, Anant; Peh, Li-Shiuan; Stojanovic, Vladimir (2012-02-08)
    With the advent of many-core chips that place substantial demand on the NoC, photonics has been investigated as a promising alternative to electrical NoCs. While numerous opto-electronic NoCs have been proposed, their ...
  • Dynamically Resizable Static CMOS Logic for Fine-Grain Leakage 
    Heo, Seongmoo; Asanovic, Krste (2004-07-12)
    Digital circuits often have a critical path that runs through a smallsubset of the component subblocks, but where the path changes dynamicallyduring operation. Dynamically resizable static CMOS (DRCMOS) logic isproposed ...
  • Dynamic Input/Output Automata: A Formal Model for Dynamic Systems 
    Attie, Paul C.; Lynch, Nancy A. (2003-07-26)
    We present a mathematical state-machine model, the Dynamic I/O Automaton (DIOA) model, for defining and analyzing dynamic systems of interacting components. The systems we consider are dynamic in two senses: (1) components ...
  • Early Sketch Processing with Application in HMM Based Sketch Recognition 
    Sezgin, Tevfik Metin; Davis, Randall (2004-07-28)
    Freehand sketching is a natural and crucial part of everyday humaninteraction, yet is almost totally unsupported by current user interfaces. With the increasing availability of tablet notebooks and pen based PDAs, sketchbased ...
  • Eclat: Automatic Generation and Classification of Test Inputs 
    Pacheo, Carlos; Ernst, Michael D. (2004-10-14)
    This paper describes a technique that helps a test engineerselect, from a large set of randomly generated testinputs, a small subset likely to reveal faults in the softwareunder test. The technique takes a program or ...
  • Efficient Cache Coherence on Manycore Optical Networks 
    Psota, James; Agarwal, Anant; Miller, Jason; Beckmann, Nathan; Kurian, George (2010-02-11)
    Ever since industry has turned to parallelism instead of frequency scaling to improve processor performance, multicore processors have continued to scale to larger and larger numbers of cores. Some believe that multicores ...
  • Efficient Image Matching with Distributions of Local Invariant Features 
    Grauman, Kristen; Darrell, Trevor (2004-11-22)
    Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature sets' similarity via a voting scheme (which ...
  • An Efficient Learning Procedure for Deep Boltzmann Machines 
    Salakhutdinov, Ruslan; Hinton, Geoffrey (2010-08-04)
    We present a new learning algorithm for Boltzmann Machines that contain many layers of hidden variables. Data-dependent statistics are estimated using a variational approximation that tends to focus on a single mode, and ...
  • Efficient Marginal Likelihood Optimization in Blind Deconvolution 
    Levin, Anat; Weiss, Yair; Durand, Fredo; Freeman, William T. (2011-04-04)
    In blind deconvolution one aims to estimate from an input blurred image y a sharp image x and an unknown blur kernel k. Recent research shows that a key to success is to consider the overall shape of the posterior distribution ...
  • Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure 
    Ono, Masahiro; Williams, Brian C. (2008-03-06)
    When controlling dynamic systems such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster by taking a more challenging path. This paper ...
  • Efficient Object Recognition and Image Retrieval for Large-Scale Applications 
    Lee, John J. (2008-05-06)
    Algorithms for recognition and retrieval tasks generally call for both speed and accuracy. When scaling up to very large applications, however, we encounter additional significant requirements: adaptability and scalability. ...
  • Efficient POMDP Forward Search by Predicting the Posterior Belief Distribution 
    Roy, Nicholas; He, Ruijie (2009-09-23)
    Online, forward-search techniques have demonstrated promising results for solving problems in partially observable environments. These techniques depend on the ability to efficiently search and evaluate the set of beliefs ...
  • Efficient Specification-Assisted Error Localization and Correction 
    Demsky, Brian; Cadar, Cristian; Roy, Daniel; Rinard, Martin (2003-11-13)
    We present a new error localization tool, Archie, that accepts aspecification of key data structure consistency constraints, then generatesan algorithm that checks if the data structures satisfy theconstraints. We also ...
  • Efficient, Verifiable Binary Sandboxing for a CISC Architecture 
    McCamant, Stephen; Morrisett, Greg (2005-05-02)
    Executing untrusted code while preserving security requiresenforcement of memory and control-flow safety policies:untrusted code must be prevented from modifying memory orexecuting code except as explicitly allowed. ...
MIT-Mirage