1480 search results - page 159 / 296 » Distributed algorithms for weighted problems in sparse graph... |
121
click to vote
DCOSS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
109
click to vote
CIAC
2000
Springer
15 years 5 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
97
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
128
Voted
MOBICOM
2012
ACM
13 years 3 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
102
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...