166 search results - page 17 / 34 » A fast distributed approximation algorithm for minimum spann... |
STACS
2001
Springer
13 years 11 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
ISAAC
2004
Springer
14 years 20 days ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
STACS
2001
Springer
13 years 11 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
ICIP
1999
IEEE
14 years 9 months ago
1999
IEEE
This paper presents a toolbox for interactive image segmentation based on a series of nested partitions of increasing coarseness. The user can navigate among the different resolut...
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...