Advanced Search
DSpace@MIT

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Issue Date

Research and Teaching Output of the MIT Community

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Issue Date

Sort by: Order: Results:

  • Task-Structured Probabilistic I/O Automata 
    Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; Pereira, Olivier; Segala, Roberto (May 28, 20)
    Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices. In order to use these frameworks to express claims about probabilities of ...
  • High Spatial Resolution BRDFs with Metallic powders Using Wave Optics Analysis 
    Levin, Anat; Glasner, Daniel; Xiong, Ying; Durand, Fredo; Freeman, William; Matusik, Wojciech; Zickler, Todd (2013-04-24)
    This manuscript completes the analysis of our SIGGRAPH 2013 paper "Fabricating BRDFs at High Spatial Resolution Using Wave Optics" in which photolithography fabrication was used for manipulating reflectance effects. While ...
  • Compositional Policy Priors 
    Wingate, David; Diuk, Carlos; O'Donnell, Timothy; Tenenbaum, Joshua; Gershman, Samuel (2013-04-12)
    This paper describes a probabilistic framework for incorporating structured inductive biases into reinforcement learning. These inductive biases arise from policy priors, probability distributions over optimal policies. ...
  • Tracking 3-D Rotations with the Quaternion Bingham Filter 
    Glover, Jared; Kaelbling, Leslie Pack (2013-03-27)
    A deterministic method for sequential estimation of 3-D rotations is presented. The Bingham distribution is used to represent uncertainty directly on the unit quaternion hypersphere. Quaternions avoid the degeneracies of ...
  • Faces as a "Model Category" for Visual Object Recognition 
    Tan, Cheston; Poggio, Tomaso (2013-03-18)
    Visual recognition is an important ability that is central to many everyday tasks such as reading, navigation and social interaction, and is therefore actively studied in neuroscience, cognitive psychology and artificial ...
  • A Plan for Optimizing Network-Intensive Cloud Applications 
    LaCurts, Katrina; Deng, Shuo; Balakrishnan, Hari (2013-02-12)
    A significant and growing number of applications deployed on cloud infrastructures are network-intensive. These applications are frequently bottlenecked by the speed of network connections between the machines on which ...
  • Asynchronous Failure Detectors 
    Cornejo, Alejandro; Lynch, Nancy; Sastry, Srikanth (2013-01-30)
    Failure detectors -- oracles that provide information about process crashes -- are an important abstraction for crash tolerance in distributed systems. The generality of failure-detector theory, while providing great ...
  • Securing Deployed RFIDs by Randomizing the Modulation and the Channel 
    Wang, Jue; Hassanieh, Haitham; Katabi, Dina; Kohno, Tadayoshi (2013-01-12)
    RFID cards are widely used today in sensitive applications such as access control, payment systems, and asset tracking. Past work shows that an eavesdropper snooping on the communication between a card and its legitimate ...
  • The computational magic of the ventral stream: sketch of a theory (and why some deep architectures work). 
    Poggio, Tomaso; Mutch, Jim; Leibo, Joel; Rosasco, Lorenzo; Tacchetti, Andrea (2012-12-29)
    This paper explores the theoretical consequences of a simple assumption: the computational goal of the feedforward path in the ventral stream -- from V1, V2, V4 and to IT -- is to discount image transformations, after ...
  • 5D Covariance Tracing for Efficient Defocus and Motion Blur 
    Belcour, Laurent; Soler, Cyril; Subr, Kartic; Holzschuch, Nicolas; Durand, Fredo (2012-11-16)
    The rendering of effects such as motion blur and depth-of-field requires costly 5D integrals. We dramatically accelerate their computation through adaptive sampling and reconstruction based on the prediction of the anisotropy ...
  • Patch complexity, finite pixel correlations and optimal denoising 
    Levin, Anat; Nadler, Boaz; Durand, Fredo; Freeman, William T. (2012-10-07)
    Image restoration tasks are ill-posed problems, typically solved withpriors. Since the optimal prior is the exact unknown density of natural images,actual priors are only approximate and typically restricted to small ...
  • Monitoring the Execution of Temporal Plans for Robotic Systems 
    Levine, Steven J. (2012-10-04)
    To achieve robustness in dynamic and uncertain environments, robotic systems must monitor the progress of their plans during execution. This thesis develops a plan executive called Pike that is capable of executing and ...
  • A Gaussian Approximation of Feature Space for Fast Image Similarity 
    Gharbi, Michael; Malisiewicz, Tomasz; Paris, Sylvain; Durand, Frédo (2012-10-01)
    We introduce a fast technique for the robust computation of image similarity. It builds on a re-interpretation of the recent exemplar-based SVM approach, where a linear SVM is trained at a query point and distance is ...
  • Robust Tracking for Real-Time Dense RGB-D Mapping with Kintinuous 
    Whelan, Thomas; Johannsson, Hordur; Kaess, Michael; Leonard, John J.; McDonald, John (2012-09-17)
    This paper describes extensions to the Kintinuous algorithm for spatially extended KinectFusion, incorporating the following additions: (i) the integration of multiple 6DOF camera odometry estimation methods for robust ...
  • Aeolus Reference Manual 
    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 ...
  • Multiscale Geometric Methods for Data Sets I: Multiscale SVD, Noise and Curvature 
    Little, Anna V.; Maggioni, Mauro; Rosasco, Lorenzo (2012-09-08)
    Large data sets are often modeled as being noisy samples from probability distributions in R^D, with D large. It has been noticed that oftentimes the support M of these probability distributions seems to be well-approximated ...
  • A Social-Welfare Optimal Probabilistic Mechanism for Knightian Single-Good Auctions 
    Chiesa, Alessandro; Micali, Silvio; Zhu, Zeyuan Allen (2012-09-07)
    We provide an optimal probabilistic mechanism for maximizing social welfare in single-good auctions when each player does not know his true valuation for the good, but only a set of valuations that is guaranteed to include ...
  • Bounded-Contention Coding for Wireless Networks in the High SNR Regime 
    Censor-Hillel, Keren; Haeupler, Bernhard; Lynch, Nancy; Medard, Muriel (2012-08-27)
    Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ...
  • From Formal Methods to Executable Code 
    Musial, Peter M. (2012-08-27)
    The objective of this work is the derivation of software that is verifiably correct. Our approach is to abstract system specifications and model these in a formal framework called Timed Input/Output Automata, which provides ...
  • Using Program Synthesis for Social Recommendations 
    Cheung, Alvin; Solar-Lezama, Armando; Madden, Samuel (2012-08-13)
    This paper presents a new approach to select events of interest to a user in a social media setting where events are generated by the activities of the user's friends through their mobile devices. We argue that given the ...
MIT-Mirage