1201 search results - page 229 / 241 » Linear Probing and Graphs |
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
TSP
2010
13 years 4 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
PODC
2012
ACM
12 years 7 days ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper, we propose a novel predictive model for
object boundary, which can integrate information from any
sources. The model is a dynamic “object” model whose
manifes...