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:

  • Lee, John J. (2008-04-07)
    LIBPMK is a C++ implementation of Grauman and Darrell's pyramid match algorithm. This toolkit provides a flexible framework with which developers can quickly match sets of image features and run experiments. LIBPMK provides ...
  • Shim, Keun Sup; Cho, Myong Hyon; Lis, Mieszko; Khan, Omer; Devadas, Srinivas (2011-05-02)
    Directory-based cache coherence is a popular mechanism for chip multiprocessors and multicores. The directory protocol, however, requires multicast for invalidation messages and the collection of acknowledgement messages, ...
  • Moore, David; Olson, Edwin; Huang, Albert (2009-09-02)
    We describe the Lightweight Communications and Marshalling (LCM) library for message passing and data marshalling. The primary goal of LCM is to simplify the development of low-latency message passing systems, targeted at ...
  • Chockler, Gregory; Malkhi, Dahlia (2004-04-22)
    We propose light-weight lease primitives to leverage fault-tolerant coordination among clients accessing a shared storage infrastructure (such as network attached disks or storage servers). In our approach, leases are ...
  • McGeachie, Michael (2007-02-01)
    Existing preference reasoning systems have been successful insimple domains. Broader success requires more natural and moreexpressive preference representations. This thesis develops arepresentation of logical preferences ...
  • Georgiou, Chryssis; Musial, Peter M.; Shvartsman, Alexander A. (2004-04-12)
    Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributedsystems easier. However, combining linearizability with efficiency in practical algorithms is difficult. ...
  • Rinard, Martin (2012-02-23)
    We present a new synchronization-free space-subdivision tree construction algorithm. Despite data races, this algorithm produces trees that are consistent enough for the client Barnes-Hut center of mass and force computation ...
  • Khabbazian, Majid; Kuhn, Fabian; Lynch, Nancy; Medard, Muriel; ParandehGheibi, Ali (2010-08-02)
    Most medium access control mechanisms discard collided packets and consider interference harmful. Recent work on Analog Network Coding (ANC) suggests a different approach, in which multiple interfering transmissions are ...
  • Salcianu, Alexandru; Arkoudas, Konstantine (2004-12-16)
    This technical report describes our experience using the interactive theorem proverAthena for proving the correctness of abstract interpretation-based dataflow analyses.For each analysis, our methodology requires the ...
  • Rudin, Robert (2008-02-17)
    Hurricane Katrina showed that the current methods for handling medicalrecords are minimally resilient to large scale disasters. This research presents a preliminary model for measuring the resilience of medical records ...
  • Monteleoni, Claire; Balakrishnan, Hari; Feamster, Nick; Jaakkola, Tommi (2004-10-27)
    This paper addresses the problem of managing the tradeoff betweenenergy consumption and performance in wireless devices implementingthe IEEE 802.11 standard. To save energy, the 802.11 specificationproposes a power-saving ...
  • Thies, William; Hall, Steven; Amarasinghe, Saman (2007-11-30)
    Due to the high data rates involved in audio, video, and signalprocessing applications, it is imperative to compress the data todecrease the amount of storage used. Unfortunately, this implies thatany program operating on ...
  • Richter, Charles; Vega-Brown, William; Roy, Nicholas (2015-04-27)
    We document two environment-generating distributions used for sampling random 2D maps. The first generates random hallway environments based on a Markov chain and the second generates random forest environments based on ...
  • Immorlica, Nicole; Mahdian, Mohammad (2003-07-28)
    Many centralized two-sided markets form a matching between participantsby running a stable marriage algorithm. It is a well-knownfact that no matching mechanism based on a stable marriage algorithmcan guarantee truthfulness ...
  • Grauman, Kristen Lorraine (2006-08-11)
    In numerous domains it is useful to represent a single example by the collection of local features or parts that comprise it. In computer vision in particular, local image features are a powerful way to describe images of ...
  • Abadi, Daniel J.; Myers, Daniel S.; DeWitt, David J.; Madden, Samuel R. (2006-11-27)
    There has been renewed interest in column-oriented database architectures in recent years. For read-mostly query workloads such as those found in data warehouse and decision support applications, ``column-stores'' have ...
  • Caponnetto, Andrea; Poggio, Tomaso; Bouvrie, Jake; Rosasco, Lorenzo; Smale, Steve (2008-11-26)
    We propose a natural image representation, the neural response, motivated by the neuroscience of the visual cortex. The inner product defined by the neural response leads to a similarity measure between functions which we ...
  • Rademacher, Luis; Vempala, Santosh; Wang, Grant (2005-03-29)
    We present two new results for the problem of approximating a given real m by n matrix A by a rank-k matrix D, where k < min{m, n}, so as to minimize ||A-D||_F^2. It is known that bysampling O(k/eps) rows of the matrix, ...
  • Ortiz, Luis E.; Schapire, Robert E.; Kakade, Sham M. (2006-03-20)
    We study maximum entropy correlated equilibria in (multi-player)games and provide two gradient-based algorithms that are guaranteedto converge to such equilibria. Although we do not provideconvergence rates for these ...
  • Chiesa, Alessandro; Micali, Silvio; Zhu, Zeyuan Allen (2011-02-16)
    We investigate mechanism design when the players do not exactly know their types, but have instead only partial information about them.
MIT-Mirage