Sciweavers

325 search results - page 46 / 65
» Group Nearest Neighbor Queries
Sort
View
COMPGEOM
2005
ACM
13 years 11 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...
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 11 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
IIR
2010
13 years 11 months ago
An Empirical Comparison of Collaborative Filtering Approaches on Netflix Data
Recommender systems are widely used in E-Commerce for making automatic suggestions of new items that could meet the interest of a given user. Collaborative Filtering approaches co...
Nicola Barbieri, Massimo Guarascio, Ettore Ritacco
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 11 months ago
A Generic Framework for Continuous Motion Pattern Query Evaluation
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
Petko Bakalov, Vassilis J. Tsotras
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
14 years 4 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...