Search
Now showing items 81-90 of 90
Automatic Software Upgrades for Distributed Systems
(2005-11-30)
Upgrading the software of long-lived, highly-available distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be unavailable and halting the system for an ...
Online Learning of Non-stationary Sequences
(2005-11-17)
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a class of universal learning algorithms involving ...
On Field Constraint Analysis
(2005-11-03)
We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints ...
New LSH-based Algorithm for Approximate Nearest Neighbor
(2005-11-04)
We present an algorithm for c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time ofO(dn^{1/c^2+o(1)}) and space O(dn + n^{1+1/c^2+o(1)}).
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, ...
Amorphous Medium Language
(2005-07)
Programming reliable behavior on a large mesh network composed of unreliable parts is difficult. Amorphous Medium Language addresses this problem by abstracting robustness and networking issues away from the programmer via ...
Perfect Implementation of Normal-Form Mechanisms
(2005)
Privacy and trust affect our strategic thinking, yet they have not been precisely modeled in mechanism design. In settings of incomplete information, traditional implementations of a normal-form mechanism ---by disregarding ...
Generalized Conflict Learning For Hybrid Discrete Linear Optimization
(2005-05-20)
Conflict-directed search algorithms have formed the core of practical, model-based reasoning systems for the last three decades. In many of these applications there is a series of discrete constraint optimization problems ...
Style Translation for Human Motion (Supplemental Material)
(2005-08-01)
Style translation is the process of transforming an input motion into a new style while preserving its original content. This problem is motivated by the needs of interactive applications, which require rapid processing ...
Style Translation for Human Motion
(2005-08-01)
Style translation is the process of transforming an input motion into a new style while preserving its original content. This problem is motivated by the needs of interactive applications, which require rapid processing ...