Sciweavers

41 search results - page 6 / 9
» Nearest Neighbor Search with Strong Location Privacy
Sort
View
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
14 years 1 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...
CVPR
2007
IEEE
14 years 9 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
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...
ICDE
2006
IEEE
126views Database» more  ICDE 2006»
14 years 8 months ago
Enabling Query Processing on Spatial Networks
A system that enables real time query processing on large spatial networks is demonstrated. The system provides functionality for processing a wide range of spatial queries such a...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 8 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe