Search
Now showing items 1-10 of 72
Fast Self-Healing Gradients
(2008-03)
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Self-healing gradients are a frequently used building block for distributed self-healing systems, but previous ...
Theories in Practice: Easy-to-Write Specifications that Catch Bugs
(2008-01-14)
Automated testing during development helps ensure that software works according to the test suite. Traditional test suites verify a few well-picked scenarios or example inputs. However, such example-based testing does not ...
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 ...
Simulation of Human Motion Data using Short-Horizon Model-Predictive Control
(2008-01-15)
Many data-driven animation techniques are capable of producing high quality motions of human characters. Few techniques, however, are capable of generating motions that are consistent with physically simulated environments. ...
Exact Algorithms for the Canadian Traveller Problem on Paths and Trees
(2008-01-28)
The Canadian Traveller problem is a stochastic shortest paths problem in which one learns the cost of an edge only when arriving at one of its endpoints. The goal is to find an adaptive policy (adjusting as one learns more ...
Agent Organization in the Knowledge Plane
(2008-06-11)
In designing and building a network like the Internet, we continue to face the problems of scale and distribution. With the dramatic expansion in scale and heterogeneity of the Internet, network management has become an ...
The SoftPHY Abstraction: from Packets to Symbols in Wireless Network Design
(2008-06-03)
At ever-increasing rates, we are using wireless systems to communicatewith others and retrieve content of interest to us. Current wirelesstechnologies such as WiFi or Zigbee use forward error correction todrive bit error ...
Ignorable Information in Multi-Agent Scenarios
(2008-05-12)
In some multi-agent scenarios, identifying observations that an agent can safely ignore reduces exponentially the size of the agent's strategy space and hence the time required to find a Nash equilibrium. We consider games ...
On a model of visual cortex: learning invariance and selectivity
(2008-04-04)
In this paper we present a class of algorithms for similarity learning on spaces of images. The general framework that we introduce is motivated by some well-known hierarchical pre-processing architectures for object ...
Gesture in Automatic Discourse Processing
(2008-05-07)
Computers cannot fully understand spoken language without access to the wide range of modalities that accompany speech. This thesis addresses the particularly expressive modality of hand gesture, and focuses on building ...