COMPGEOM
1997
ACM
14 years 3 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
SIGMOD
2010
ACM
14 years 4 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
SC
2003
ACM
14 years 4 months ago
2003
ACM
A Grid Information Service (GIS) stores information about the resources of a distributed computing environment and answers questions about it. We are developing RGIS, a GIS system...
FOCS
2006
IEEE
14 years 5 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) ...
ESA
2007
Springer
14 years 5 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
CPM
2007
Springer
14 years 5 months ago
2007
Springer
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
EDBT
2006
ACM
14 years 11 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...