99 search results - page 19 / 20 » Distance Approximation in Bounded-Degree and General Sparse ... |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
ADHOCNOW
2007
Springer
14 years 1 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
ICMI
2007
Springer
14 years 1 months ago
2007
Springer
The rapid development of large interactive wall displays has been accompanied by research on methods that allow people to interact with the display at a distance. The basic method...
LATIN
2010
Springer
14 years 15 days ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...