921 search results - page 40 / 185 » New Data Structures for Orthogonal Range Searching |
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
141
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
156
click to vote
MASS
2010
15 years 1 months ago
2010
Abstract--Mapping and localization for indoor robotic navigation is a well-studied field. However, existing work largely relies on long range perceptive sensors in addition to the ...
144
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
140
click to vote
KDD
2001
ACM
16 years 4 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...