2374 search results - page 72 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
SIGECOM
2011
ACM
13 years 1 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
TIT
2010
13 years 4 months ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
ICDCS
2002
IEEE
14 years 3 months ago
2002
IEEE
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
AMDO
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Many applications in computer graphics require fast and robust collision detection algorithms. The problem of simulating motion in an articulated chain has been well stud...