Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title
Now showing items 660-679 of 775
-
Sparse recovery using sparse matrices
(2008-01-10)We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a high-dimensional vector x from its lower-dimensional sketch Ax. A popular way of performing this recovery is by finding ... -
Spatial and Temporal Abstractions in POMDPs Applied to Robot Navigation
(2005-09-27)Partially observable Markov decision processes (POMDPs) are a well studied paradigm for programming autonomous robots, where the robot sequentially chooses actions to achieve long term goals efficiently. Unfortunately, ... -
Spectral Alignment of Networks
(2015-02-18)Network alignment refers to the problem of finding a bijective mapping across vertices of two or more graphs to maximize the number of overlapping edges and/or to minimize the number of mismatched interactions across ... -
Speranza: Usable, privacy-friendly software signing
(2023-09-19)Software repositories, used for wide-scale open software distribu- tion, are a significant vector for security attacks. Software signing provides authenticity, mitigating many such attacks. Developer- managed signing keys ... -
Stable Policy Routing with Provider Independence
(2005-02-08)Thousands of competing autonomous systems (ASes) mustcooperate with each other to provide global Internet connectivity.These ASes encode various economic, business,and performance decisions in their routing policies. The ... -
Staged Program Repair in SPR
(2015-03-11)We present SPR, a new program repair system that uses condition synthesis to instantiate transformation schemas to repair program defects. SPR s staged repair strategy combines a rich space of potential repairs with a ... -
Stateful Anycast for DDoS Mitigation
(2007-06-21)Distributed denial-of-service (DDoS) attacks can easily cripple victim hosts or networks, yet effective defenses remain elusive. Normal anycast can be used to force the diffusion of attack traffic over a group of several ... -
Stochastic Combinatorial Optimization with Risk
(2008-09-13)We consider general combinatorial optimization problems that can be formulated as minimizing the weight of a feasible solution wT x over an arbitrary feasible set. For these problems we describe a broad class of corresponding ... -
Stochastic Digital Circuits for Probabilistic Inference
(2008-11-24)We introduce combinational stochastic logic, an abstraction that generalizes deterministic digital circuit design (based on Boolean logic gates) to the probabilistic setting. We show how this logic can be combined with ... -
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 ...
