81
Voted
DM
1999
15 years 3 days ago
1999
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...
103
Voted
ALGORITHMICA
2010
15 years 17 days ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
110
click to vote
CCCG
2006
15 years 1 months ago
2006
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
FSTTCS
2005
Springer
15 years 6 months ago
2005
Springer
Let P be a set of n points in d-dimensional Euclidean space, where each of the points has integer coordinates from the range [−∆, ∆],
97
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
PODS
2001
ACM
16 years 17 days ago
2001
ACM
A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space -- where k is lo...