1888 search results - page 42 / 378 » Algorithms for Querying by Spatial Structure |
73
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
170
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
84
Voted
SIGIR
2008
ACM
14 years 10 months ago
2008
ACM
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
97
Voted
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a...
ESORICS
2009
Springer
15 years 5 months ago
2009
Springer
For nearest neighbor search, a user queries a server for nearby points of interest (POIs) with his/her location information. Our aim is to protect the user’s sensitive informatio...