2880 search results - page 27 / 576 » Approximate Range Searching |
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
114
click to vote
SIGIR
2011
ACM
14 years 2 months ago
2011
ACM
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
215
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
128
click to vote
CN
2004
14 years 11 months ago
2004
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
114
click to vote
KR
2004
Springer
15 years 5 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...