Sciweavers

SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
12 years 2 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
VLDB
2012
ACM
360views Database» more  VLDB 2012»
12 years 7 months ago
An adaptive updating protocol for reducing moving object database workload
In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive...
Su Chen, Beng Chin Ooi, Zhenjie Zhang
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
14 years 3 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
EDBT
2010
ACM
172views Database» more  EDBT 2010»
14 years 5 months ago
Privacy preserving group nearest neighbor queries
User privacy in location-based services has attracted great interest in the research community. We introduce a novel framework based on a decentralized architecture for privacy pr...
Tanzima Hashem, Lars Kulik, Rui Zhang
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
15 years 3 days ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias