99 search results - page 19 / 20 » Distance Approximation in Bounded-Degree and General Sparse ... |
142
click to vote
FOCS
2006
IEEE
15 years 10 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...
125
Voted
ADHOCNOW
2007
Springer
15 years 10 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...
176
click to vote
ICASSP
2011
IEEE
14 years 7 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 ...
143
click to vote
ICMI
2007
Springer
15 years 10 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...
126
click to vote
LATIN
2010
Springer
15 years 9 months 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...