19 search results - page 2 / 4 » Approximate Range Searching in External Memory |
FOCS
2009
IEEE
13 years 12 months ago
2009
IEEE
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
SISAP
2009
IEEE
13 years 12 months ago
2009
IEEE
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
AAAI
2006
13 years 6 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...