1888 search results - page 159 / 378 » Algorithms for Querying by Spatial Structure |
209
click to vote
SSD
2007
Springer
15 years 10 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
207
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
130
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
171
click to vote
SIGMETRICS
2011
ACM
14 years 7 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
189
click to vote
TKDE
2002
15 years 4 months ago
2002
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...