315 search results - page 31 / 63 » Simple Distributed Weighted Matchings |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
AAAI
2007
13 years 10 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
PAMI
2010
13 years 6 months ago
2010
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
IPPS
2002
IEEE
14 years 18 days ago
2002
IEEE
Heterogeneous computing (HC) environments composed of interconnected machines with varied computational capabilities are well suited to meet the computational demands of large, di...
HSNMC
2003
Springer
14 years 27 days ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...