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:

  • 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 ...
  • Attie, Paul C.; Lynch, Nancy A. (2013-07-08)
    We present dynamic I/O automata (DIOA), a compositional model of dynamic systems, based on I/O automata. In our model, automata can be created and destroyed dynamically, as computation proceeds. In addition, an automaton ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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. ...
  • 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 ...
  • 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 ...
  • 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. ...
  • De Mol, Christine; Rosasco, Lorenzo; De Vito, Ernesto (2008-07-24)
    Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie ["Regularization and variable selection via the elastic net" J. R. Stat. ...
  • Liskov, Moses (2003-10-14)
    Electronic cash schemes in which the bank authenticates many coins at once suffer from the problem that coins that are authenticated together can be linked to one another. Unfortunately, unless a user spends coins in a ...
  • Khan, Omer; Lis, Mieszko; Devadas, Srini (2010-06-12)
    We introduce the Execution Migration Machine (EM2), a novel, scalable shared-memory architecture for large-scale multicores constrained by off-chip memory bandwidth. EM2 reduces cache miss rates, and consequently off-chip ...
  • Katti, Sachin; Gollakota, Shyamnath; Katabi, Dina (2007-02-23)
    Traditionally, interference is considered harmful.Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite approach; it encourages ...
  • Caponnetto, Andrea; Rosasco, Lorenzo; Vito, Ernesto De; Verri, Alessandro (2005-05-27)
    This paper presents an approach to model selection for regularized least-squares on reproducing kernel Hilbert spaces in the semi-supervised setting. The role of effective dimension was recently shown to be crucial in the ...
  • Artzi, Shay; Kiezun, Adam; Newport, Calvin; Schultz, David (2006-02-23)
    Encrypted keyword search allows a server to perform a search over a set of encrypted documents on behalf of a client without learning the contents of the documents or the words being searched for. Designing a practical ...
MIT-Mirage