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:

  • Weinstein, Eugene; Steele, Kenneth; Agarwal, Anant; Glass, James (2004-04-14)
    Ubiquitous computing environments are characterized by an unboundedamount of noise and crosstalk. In these environments, traditionalmethods of sound capture are insufficient, and array microphones areneeded in order to ...
  • Thies, William; Urbanski, John Paul; Thorsen, Todd; Amarasinghe, Saman (2006-05-05)
    Microfluidic devices are emerging as an attractive technology for automatically orchestrating the reactions needed in a biological computer. Thousands of microfluidic primitives have already been integrated on a single ...
  • Kuhn, Fabian; Newport, Calvin; Lynch, Nancy (2009-05-11)
    A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an Abstract MAC Layer. This service provides reliable local ...
  • Kuhn, Fabian; Lynch, Nancy; Newport, Calvin (2010-08-26)
    A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an abstract MAC layer. This service provides reliable local ...
  • Newport, Calvin; Lynch, Nancy; Kuhn, Fabian (2009-02-21)
    A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an Abstract MAC Layer. This service provides reliable local ...
  • Zeng, Gang; Paris, Sylvain; Quan, Long; Sillion, Francois (2005-11-18)
    We introduce a new surface representation, the patchwork, to extend the problem of surface reconstruction from multiple images. A patchwork is the combination of several patches that are built one by one. This design ...
  • Salcianu, Alexandru; Rinard, Martin (2004-05-17)
    We present a new method purity analysis for Java programs.A method is pure if it does not mutate any location that exists in the program state right before method invocation.Our analysis is built on top of a combined pointer ...
  • Blackmore, Lars; Funiak, Stanislav; Williams, Brian (2006-04-28)
    Robotic and embedded systems have become increasingly pervasive in applicationsranging from space probes and life support systems to robot assistants. In order to act robustly in the physical world, robotic systems must ...
  • Kushman, Nate; Katabi, Dina; Wroclawski, John (2006-01-27)
    This paper proposes an isolation layer -- a shim -- betweeninter-domain routing and packet forwarding. The job of this layer isto coordinate between Autonomous Systems (AS's) on when and how tomodify the forwarding state ...
  • Badoiu, Mihai; Indyk, Piotr; Sidiropoulos, Anastasios (2004-07-05)
    We present a constant-factor approximation algorithm for computing anembedding of the shortest path metric of an unweighted graph into atree, that minimizes the multiplicative distortion.
  • Rodrigues, Rodrigo; Liskov, Barbara (2003-09-25)
    We prove correctness of a Byzantine-fault-tolerant replication algorithm for a read/writeatomic memory that supports a dynamic replica set.
  • Caponnetto, Andrea; Yao, Yuan (2006-09-10)
    We consider learning algorithms induced by regularization methods in the regression setting. We show that previously obtained error bounds for these algorithms using a-priori choices of the regularization parameter, can ...
  • Gardiol, Natalia H.; Kaelbling, Leslie Pack (2008-07-29)
    We describe a method to use structured representations of the environment’s dynamics to constrain and speed up the planning process. Given a problem domain described in a probabilistic logical description language, we ...
  • Rosasco, Lorenzo; Pereverzyev, Sergei; De Vito, Ernesto (2008-10-16)
    The regularization parameter choice is a fundamental problem in supervised learning since the performance of most algorithms crucially depends on the choice of one or more of such parameters. In particular a main theoretical ...
  • Richards, Whitman; Winston, Patrick Henry; Finlayson, Mark Alan (2009-12-17)
    Report of a Workshop held at the Wylie Center, Beverly, MA, Oct 8-10 2009
  • Liang, Percy; Srebro, Nati (2005-01-03)
    We present a dynamic data structure that keeps track of an acyclic hypergraph (equivalently, a triangulated graph) and enables verifying that adding a candidate hyperedge (clique) will not break the acyclicity of the ...
  • Liskov, Barbara (2012-09-14)
    This document describes the interface that the Aeolus information flow platform provides for users who are implementing applications using Java. The document explains how the Aeolus features are made available by means of ...
  • Paris, Sylvain; Durand, Fredo (2006-11-09)
    The bilateral filter is a nonlinear filter that smoothes a signal while preserving strong edges. It has demonstrated great effectiveness for a variety of problems in computer vision and computer graphics, and fast versions ...
  • Aryananda, Lijin (2007-04-03)
    This thesis presents an integrated framework and implementation for Mertz, an expressive robotic creature for exploring the task of face recognition through natural interaction in an incremental and unsupervised fashion. ...
  • Kouh, Minjoon; Poggio, Tomaso (2004-12-31)
    Tuning to an optimal stimulus is a widespread property of neurons in cortex. We propose that such tuning is a consequence of normalization or gain control circuits. We also present a biologically plausible neural circuitry ...
MIT-Mirage