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:

  • 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 ...
  • Micali, Silvio; Valiant, Paul (2008-11-13)
    Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mechanism design, as it enables one to predict with confidence which strategies INDEPENDENT players will actually choose. ...
  • Jaggi, Sidharth; Langberg, Michael; Katti, Sachin; Ho, Tracy; Katabi, Dina; Medard, Muriel (2006-08-05)
    Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information ...
  • Chen, Jing; Micali, Silvio (2008-12-02)
    We present two resilient mechanisms: the first for the provision of a public good, and the second for the provision of a private good. Both mechanisms adopt a knowledge-based benchmark.
  • Micali, Silvio; Chen, Jing (2008-12-02)
    We present two resilient mechanisms for the provision of a public good. Both mechanisms adopt a knowledge-based benchmark.
  • Micali, Silvio; Valiant, Paul (2007- 11-0)
    Little is known about generating revenue in UNRESTRICTED combinatorial auctions. (In particular, the VCG mechanism has no revenue guarantees.) In this paper we determine how much revenue can be guaranteed in such auctions. ...
  • Vutukuru, Mythili; Feamster, Nick; Walfish, Michael; Balakrishnan, Hari; Shenker, Scott (2006-04-14)
    IP prefixes undermine three goals of Internet routing: accurate reflection of network-layer reachability, secure routing messages, and effective traffic control. This paper presents Atomic IP (AIP), a simple change to ...
  • Tseng, Jessica H.; Asanovic, Krste (2006-09-18)
    RingScalar is a complexity-effective microarchitecture for out-of-order superscalar processors, that reduces the area, latency, and power of all major structures in the instruction flow. The design divides an N-way ...
MIT-Mirage