736 search results - page 30 / 148 » A dynamic data structure for approximate range searching |
130
Voted
SODA
2004
ACM
15 years 6 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
141
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
147
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
154
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
160
Voted
INFOSCALE
2007
ACM
15 years 6 months ago
2007
ACM
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...