Sciweavers

DM
1999
65views more  DM 1999»
13 years 11 months ago
Finite three dimensional partial orders which are not sphere orders
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...
Stefan Felsner, Peter C. Fishburn, William T. Trot...
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
13 years 11 months ago
Computing the Greedy Spanner in Near-Quadratic Time
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...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...
CCCG
2006
14 years 29 days ago
Geometric Separator for d-Dimensional Ball Graphs
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....
Kebin Wang, Shang-Hua Teng
FSTTCS
2005
Springer
14 years 5 months ago
No Coreset, No Cry: II
Let P be a set of n points in d-dimensional Euclidean space, where each of the points has integer coordinates from the range [−∆, ∆],
Michael Edwards, Kasturi R. Varadarajan
FOCS
2006
IEEE
14 years 5 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
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) ...
Alexandr Andoni, Piotr Indyk
PODS
2001
ACM
120views Database» more  PODS 2001»
14 years 11 months ago
Database-friendly random projections
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...
Dimitris Achlioptas