Sciweavers

1480 search results - page 242 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 5 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
IJCV
2006
165views more  IJCV 2006»
15 years 3 months ago
A Riemannian Framework for Tensor Computing
Tensors are nowadays a common source of geometric information. In this paper, we propose to endow the tensor space with an affine-invariant Riemannian metric. We demonstrate that ...
Xavier Pennec, Pierre Fillard, Nicholas Ayache
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 3 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 8 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 9 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan