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:

  • 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. ...
  • Elastic-Net Regularization in Learning Theory 
    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. ...
  • Electronic Cash with Blind Deposits: How to Have No Spare Change 
    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 ...
  • EM2: A Scalable Shared-Memory Multicore Architecture 
    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 ...
  • Embracing Wireless Interference: Analog Network Coding 
    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 ...
  • Empirical Effective Dimension and Optimal Rates for Regularized Least Squares Algorithm 
    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 ...
  • Encrypted Keyword Search in a Distributed Storage System 
    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 ...
  • Energy Scalability of On-Chip Interconnection Networks in Multicore Architectures 
    Agarwal, Anant; Psota, James; Eastep, Jonathan; Konstantakopoulos, Theodoros (2008-11-11)
    On-chip interconnection networks (OCNs) such as point-to-point networks and buses form the communication backbone in systems-on-a-chip, multicore processors, and tiled processors. OCNs can consume significant portions of ...
  • Enhanced Visual Authoring Using Operation History 
    Su, Sara L. (2009-06-24)
    Graphical editors have introduced great flexibility to the designer's workflow, providing powerful digital tools and enabling the creation of complex and compelling designs. This thesis presents methods for improving these ...
  • Enhancing Availability and Security Through Failure-Oblivious Computing 
    Rinard, Martin; Cadar, Cristian; Dumitran, Daniel; Roy, Daniel M.; Jr., William S. Beebee (2004-02-06)
    We present a new technique, failure-oblivious computing,that enables programs to continue to execute through memoryerrors without memory corruption. Our safe compilerfor C inserts checks that dynamically detect invalid ...
MIT-Mirage