SIGMOD
2004
ACM
14 years 10 months ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
AAIM
2009
Springer
15 years 12 hour ago
2009
Springer
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
144
click to vote
GIS
2007
ACM
15 years 6 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
144
click to vote
ICDE
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...