2084 search results - page 254 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
IPPS
2010
IEEE
14 years 8 months ago
2010
IEEE
New architectures have recently been proposed and deployed to support end-to-end advance reservation of network resources. These architectures rely on the use a centralized schedul...
CPAIOR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
106
click to vote
COLT
2010
Springer
14 years 8 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...