Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title
Now showing items 669-688 of 775
-
Structuring Unreliable Radio Networks
(2011-12-22)In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model. This model includes two types of links: reliable links, which always deliver ... -
Subcontracted Rational SFE
(2005-11-02)In their paper, "Rational Secure Computation and Ideal Mechanism Design," Izmalkov, Lepinski and Micali show that any one-shot mediated game can be simulated by the players themselves, without the help of a trusted mediator, ... -
Submodular Secretary Problem and Extensions
(2010-02-01)Online auction is an essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions ... -
Sufficient Conditions for Uniform Stability of Regularization Algorithms
(2009-12-01)In this paper, we study the stability and generalization properties of penalized empirical-risk minimization algorithms. We propose a set of properties of the penalty term that is sufficient to ensure uniform ?-stability: ... -
A Suite of Techniques for Describing Activity in Terms of Events
(2015-03-30)This report presents a set of software techniques that support the tasks of event recognition, summarization of event sequences, explanation of recognized events, explanation of non-recognized events, prediction of event ... -
Supplement to "Distributed Quota Enforcement for Spam Control"
(2006-04-29)This report is a supplement to our paper "Distributed Quota Enforcement forSpam Control" (NSDI 2006). We assume here that the reader has readthe main paper. In this report, we first analyze the enforcer nodes'key-value ... -
SWIFT: A Narrowband-Friendly Cognitive Wideband Network
(2008-08-17)Wideband technologies in the unlicensed spectrum can satisfy the ever-increasing demands for wireless bandwidth created by emerging rich media applications. The key challenge for such systems, however, is to allow narrowband ... -
Symbolic Execution for (Almost) Free: Hijacking an Existing Implementation to Perform Symbolic Execution
(2014-04-22)Symbolic execution of a language is traditionally achieved by replacing the language s interpreter with an entirely new interpreter. This may be an unnecessary burden, and it is tempting instead to try to use as much of ... -
Synthesis of Randomized Accuracy-Aware Map-Fold Programs
(2013-12-29)We present Syndy, a technique for automatically synthesizing randomized map/fold computations that trade accuracy for performance. Given a specification of a fully accurate computation, Syndy automatically synthesizes ... -
Systematic Conformational Search with Constraint Satisfaction
(2004-10-01)Throughout biological, chemical, and pharmaceutical research,conformational searches are used to explore the possiblethree-dimensional configurations of molecules. This thesis describesa new systematic method for ... -
Systematic Removal of Nondeterminism for Code Generation in I/O Automata
(2004-07-19)The Input/Output (I/O) automaton model developed by Lynch and Tuttle models components in asynchronous concurrentsystems as labeled transition systems. IOA is a precise language for describing I/O automata and for stating ... -
Task-Structured Probabilistic I/O Automata
(2009.)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 ... -
Task-Structured Probabilistic I/O Automata
(2006-03-31)In the Probabilistic I/O Automata (PIOA) framework, nondeterministicchoices are resolved using perfect-information schedulers,which are similar to history-dependent policies for Markov decision processes(MDPs). These ... -
Task-Structured Probabilistic I/O Automata
(2006-09-05)Modeling frameworks such as Probabilistic I/O Automata (PIOA) andMarkov Decision Processes permit both probabilistic andnondeterministic choices. In order to use such frameworks to express claims about probabilities of ... -
tBurton: A Divide and Conquer Temporal Planner
(2014-10-24)Planning for and controlling a network of interacting devices requires a planner that accounts for the automatic timed transitions of devices while meeting deadlines and achieving durative goals. For example, a planner for ... -
Team MIT Urban Challenge Technical Report
(2007-12-14)This technical report describes Team MIT’s approach to theDARPA Urban Challenge. We have developed a novel strategy forusing many inexpensive sensors, mounted on the vehicle periphery,and calibrated with a new cross-modal ... -
Temporally Scalable Visual SLAM using a Reduced Pose Graph
(2012-05-25)In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that use keyframes, our approach continually uses new measurements ... -
The Tensor Algebra Compiler
(2017-02-17)Tensor and linear algebra is pervasive in data analytics and the physical sciences. Often the tensors, matrices or even vectors are sparse. Computing expressions involving a mix of sparse and dense tensors, matrices and ... -
The Architecture of MAITA: A Tool for Monitoring, Analysis, and Interpretation
(2004-05-18)This report describes the aims, functions, and organization of the MAITAsystem for knowledge-based construction, adaptation, and control of networks of monitoringprocesses. -
The Design of a Relational Engine
(2006-09-29)The key design challenges in the construction of a SAT-based relational engine are described, and novel techniques are proposed to address them. An efficient engine must have a mechanism for specifying partial solutions, ...
