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:

  • Kim, Sunghun; Artzi, Shay; Ernst, Michael D. (2007-11-20)
    It is difficult to fix a problem without being able to reproduce it.However, reproducing a problem is often difficult and time-consuming.This paper proposes a novel algorithm, ReCrash, that generatesmultiple unit tests ...
  • Sollins, Karen R. (2002-03-01)
    Naming is a central element of a distributed or network system design. Appropriate design choices are central. This paper explores a taxonomy of naming systems, and engineering tradeoffs as an aid to the namespace designer. ...
  • Abadi, Daniel J.; Madden, Samuel R. (2004-03-22)
    This paper presents an algorithm for handling many types of filters insensor networks that cannot be expressed using a simple predicate.Specifically, the action of the filter may be predicated on sensor produceddata where ...
  • Kiezun, Adam; Ernst, Michael D.; Tip, Frank; Fuhrer, Robert M. (2006-09-05)
    Type safety and expressiveness of many existing Java libraries and theirclient applications would improve, if the libraries were upgraded to definegeneric classes. Efficient and accurate tools exist to assist clientapplications ...
  • Ernst, Michael D.; Marrero, John; Dig, Danny (2008-09-30)
    Parallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 packagejava.util.concurrent (j.u.c.) supports writing concurrent programs: much of the complexity of writing threads-safe and ...
  • Mroueh, Youssef; Poggio, Tomaso; Rosasco, Lorenzo (2011-06-03)
    In this work we discuss a regularization framework to solve multi-category when the classes are described by an underlying class taxonomy. In particular we discuss how to learn the class taxonomy while learning a multi-category ...
  • Wolf, Lior; Martin, Ian (2004-11-12)
    In this paper, we present and analyze a novel regularization technique based on enhancing our dataset with corrupted copies of the original data. The motivation is that since the learning algorithm lacks information about ...
  • Wu, Eugene; Madden, Samuel; Zhang, Yang; Jones, Evan; Curino, Carlo (2010-03-14)
    In this paper, we make the case for â databases as a serviceâ (DaaS), with two target scenarios in mind: (i) consolidation of data management functionality for large organizations and (ii) outsourcing data management ...
  • Gardiol, Natalia Hernandez (2007-12-31)
    This thesis proposes a synthesis of logic and probability for solving stochastic sequential decision-making problems. We address two main questions: How can we take advantage of logical structure to speed up planning in a ...
  • Misailovic, Sasa; Carbin, Michael; Achour, Sara; Qi, Zichao; Rinard, Martin (2014-01-09)
    Emerging high-performance architectures are anticipated to contain unreliable components (e.g., ALUs) that offer low power consumption at the expense of soft errors. Some applications (such as multimedia processing, machine ...
  • Cornejo, Alejandro; Lynch, Nancy (2010-09-09)
    Local distributed algorithms can only gather sufficient information to identify local graph traits, that is, properties that hold within the local neighborhood of each node. However, it is frequently the case that global ...
  • Boneh, Dan; Mazieres, David; Popa, Raluca Ada (2011-03-30)
    Remote storage of data has become an increasingly attractive and advantageous option, especially due to cloud systems. While encryption protects the data, it does not hide the access pattern to the data. A natural solution ...
  • Wentzlaff, David; Agarwal, Anant; Hoffmann, Henry (2009-05-05)
    This paper presents remote store programming (RSP). This paradigm combines usability and efficiency through the exploitation of a simple hardware mechanism, the remote store, which can easily be added to existing ...
  • Finlayson, Mark Alan (2016-11-08)
    On March 30 & 31, 2015, an international group of twenty-three researchers with expertise in linguistic annotation convened in Sunny Isles Beach, Florida to discuss problems with and potential solutions for the state of ...
  • Radul, Alexey (2007-10-22)
    Reasoning with probabilistic models is a widespread andsuccessful technique in areas ranging from computer vision, to naturallanguage processing, to bioinformatics. Currently, these reasoningsystems are either coded from ...
  • Felzenszwalb, Pedro F. (2003-08-08)
    We present a set of techniques that can be used to represent anddetect shapes in images. Our methods revolve around a particularshape representation based on the description of objects usingtriangulated polygons. This ...
  • Zewdie, Dawit H.; Konidaris, George (2015-11-24)
    Recent years have seen increased interest in non-parametric reinforcement learning. There are now practical kernel-based algorithms for approximating value functions; however, kernel regression requires that the underlying ...
  • Wormald, Nicholas; Richards, Whitman (2009-03-30)
    Understanding the dynamics of network evolution rests in part on the representation chosen to characterize the evolutionary process. We offer a simple, three-parameter representation based on subgraphs that capture three ...
  • Micali, Silvio; Chen, Jing (2008-12-17)
    We present various resilient auction mechanisms for a good in limited supply. Our mechanisms achieve both player-knowledge and aggregated player-knowledge benchmarks.
  • Micali, Silvio; Chen, Jing (2008-10-08)
    We put forward a new mechanism achieving a high benchmark for (both revenue and) the sum of revenue and efficiency in truly combinatorial auctions. Notably, our mechanism guarantees its performance (1) in a very adversarial ...
MIT-Mirage