Sciweavers

466 search results - page 43 / 94
» Efficient Object Querying for Java
Sort
View
VLDB
2006
ACM
171views Database» more  VLDB 2006»
15 years 10 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
15 years 11 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
TKDE
2010
190views more  TKDE 2010»
14 years 8 months ago
Effectively Indexing the Uncertain Space
—With the rapid development of various optical, infrared, and radar sensors and GPS techniques, there are a huge amount of multidimensional uncertain data collected and accumulat...
Ying Zhang, Xuemin Lin, Wenjie Zhang, Jianmin Wang...
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
15 years 10 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
CC
2001
Springer
121views System Software» more  CC 2001»
15 years 2 months ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert