Sciweavers

110 search results - page 16 / 22
» Fast Nearest Neighbor Search on Road Networks
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
VLDB
2007
ACM
169views Database» more  VLDB 2007»
14 years 8 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
14 years 2 months ago
Privacy Protected Query Processing on Spatial Networks
With the proliferation of mobile devices (e.g., PDAs, cell phones, etc.), location-based services have become more and more popular in recent years. However, users have to reveal ...
Wei-Shinn Ku, Roger Zimmermann, Wen-Chih Peng, Sus...
SIGMOD
2008
ACM
124views Database» more  SIGMOD 2008»
13 years 7 months ago
Scalable network distance browsing in spatial databases
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
Hanan Samet, Jagan Sankaranarayanan, Houman Alborz...
PERVASIVE
2008
Springer
13 years 7 months ago
A fair and energy-efficient topology control protocol for wireless sensor networks
In energy constrained wireless sensor networks, energy conservation techniques are to be applied in order to maximize the system lifetime. We tackle the problem of increasing netw...
Rami Mochaourab, Waltenegus Dargie