324 search results - page 20 / 65 » Distance Approximating Trees: Complexity and Algorithms |
168
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
141
Voted
SI3D
2006
ACM
15 years 9 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
142
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
157
Voted
SODA
1992
ACM
15 years 4 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
124
Voted
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...