280 search results - page 55 / 56 » Distributed Approximation Algorithms for Planar Graphs |
ALGOSENSORS
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
CIAC
2000
Springer
14 years 1 days 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 ...