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:

  • Misailovic, Sasa; Roy, Daniel M.; Rinard, Martin (2011-01-19)
    We present a new foundation for the analysis and transformation of computer programs.Standard approaches involve the use of logical reasoning to prove that the applied transformation does not change the observable semantics ...
  • Beal, Jacob (2004-09)
    Amorphous computing considers the problem of controllingmillions of spatially distributed unreliable devices which communicateonly with nearby neighbors. To program such a system, we need a highleveldescription language ...
  • Bachrach, Jonathan; Beal, Jacob (2006-06)
    In many sensor network applications, the network is deployedto approximate a physical space. The network itself is not ofinterest: rather, we are interested in measuring the propertiesof the space it fills, and of establishing ...
  • Bachrach, Jonathan; Beal, Jacob (2007)
    Many programming domains involve the manipulation of values distributed through a manifold - examples include sensor networks, smart materials, and biofilms. This paper describes a programming semantics for manifolds based ...
  • Quattoni, Ariadna; Carreras, Xavier; Collins, Michael; Darrell, Trevor (2008-07-23)
    Recent approaches to multi-task learning have investigated the use of a variety of matrix norm regularization schemes for promoting feature sharing across tasks.In essence, these approaches aim at extending the l1 framework ...
  • Radul, Alexey (2009-11-03)
    I propose a shift in the foundations of computation. Practically all ideas of general-purpose computation today are founded either on execution of sequences of atomic instructions, i.e., assembly languages, or on evaluation ...
  • Chockler, Gregory; Lynch, Nancy; Mitra, Sayan; Tauber, Joshua (2005-07-22)
    Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algorithms achieve atomicity has turned out ...
  • Simosa, Jorge D. (2013-06-04)
    As modern networks become highly integrated, heterogeneous, and experience exponential growth, the task of network management becomes increasingly unmanageable for network administrators and designers. The Knowledge Plane ...
  • Grauman, Kristen; Darrell, Trevor (2005-03-17)
    Discriminative learning is challenging when examples are setsof local image features, and the sets vary in cardinality and lackany sort of meaningful ordering. Kernel-based classificationmethods can learn complex decision ...
  • Grauman, Kristen; Darrell, Trevor (2006-03-18)
    Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification methods can learn complex decision boundaries, ...
  • Kuncak, Viktor (2007-01-01)
    Boolean Algebra with Presburger Arithmetic (BAPA) combines1) Boolean algebras of sets of uninterpreted elements (BA)and 2) Presburger arithmetic operations (PA). BAPA canexpress the relationship between integer variables ...
  • McCamant, Stephen; Ernst, Michael D. (2007-12-10)
    We present a new technique for determining how much information abouta program's secret inputs is revealed by its public outputs. Incontrast to previous techniques based on reachability from secretinputs (tainting), it ...
  • McCamant, Stephen; Ernst, Michael D. (2006-11-17)
    We present a new approach for tracking programs' use of data througharbitrary calculations, to determine how much information about secretinputs is revealed by public outputs. Using a fine-grained dynamicbit-tracking ...
  • Beal, Jacob; Gilbert, Seth (2003-12-17)
    We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...
  • Fergus, Rob; Torralba, Antonio; Freeman, William T. (2006-09-02)
    We call a random lens one for which the function relating the input light ray to the output sensor location is pseudo-random. Imaging systems with random lensescan expand the space of possible camera designs, allowing new ...
  • McAllester, David; Milch, Brian; Goodman, Noah D. (2008-05-03)
    We consider three desiderata for a language combining logic and probability: logical expressivity, random-world semantics, and the existence of a useful syntactic condition for probabilistic independence. Achieving these ...
  • Stiefelhagen, Rainer; Darrell, Trevor; Urtasun, Raquel; Geiger, Andreas (2008-09-26)
    Non-linear dimensionality reduction methods are powerful techniques to deal with high-dimensional datasets. However, they often are susceptible to local minima and perform poorly when initialized far from the global optimum, ...
  • Micali, Silvio; Chen, Jing (2009-11-10)
    The currently prevailing equilibrium-based approach to mechanism design suffers from a plurality of fundamental problems, and new conceptual frameworks are needed to solve or sufficiently alleviate them. In this paper, we ...
  • Shroff, Ameya (2013-06-06)
    We envision a world in which robots and humans can collaborate to perform complex tasks in real-world environments. Current motion planners successfully generate trajectories for a robot with multiple degrees of freedom, ...
  • Serre, Thomas; Riesenhuber, Maximilian (2004-07-27)
    Riesenhuber \& Poggio recently proposed a model of object recognitionin cortex which, beyond integrating general beliefs about the visualsystem in a quantitative framework, made testable predictions aboutvisual processing. ...
MIT-Mirage