Efficient search for the top-k probable nearest neighbors in uncertain databases
暂无分享,去创建一个
[1] Moni Naor,et al. Optimal aggregation algorithms for middleware , 2001, PODS '01.
[2] Man Lung Yiu,et al. Efficient top-k aggregation of ranked inputs , 2007, TODS.
[3] Sharad Mehrotra,et al. Progressive approximate aggregate queries with a multi-resolution tree structure , 2001, SIGMOD '01.
[4] Jennifer Widom,et al. Working Models for Uncertain Data , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[5] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[6] Yufei Tao,et al. Probabilistic Spatial Queries on Existentially Uncertain Data , 2005, SSTD.
[7] Jennifer Widom,et al. The Pipelined Set Cover Problem , 2005, ICDT.
[8] Ambuj K. Singh,et al. APLA: Indexing Arbitrary Probability Distributions , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[9] Yufei Tao,et al. Aggregate Processing of Planar Points , 2002, EDBT.
[10] Sunil Prabhakar,et al. Querying imprecise data in moving object environments , 2003, IEEE Transactions on Knowledge and Data Engineering.
[11] Dmitri V. Kalashnikov,et al. Index for fast retrieval of uncertain spatial point data , 2006, GIS '06.
[12] Tomoyoshi Oono,et al. Position location technologies using signal strength in cellular systems , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).
[13] Reynold Cheng,et al. Efficient Evaluation of Imprecise Location-Dependent Queries , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[14] Mohamed A. Soliman,et al. Top-k Query Processing in Uncertain Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[15] Chi-Yin Chow,et al. Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[16] Hans-Jörg Schek,et al. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.
[17] Wei Hong,et al. The design of an acquisitional query processor for sensor networks , 2003, SIGMOD '03.
[18] Hanan Samet,et al. Ranking in Spatial Databases , 1995, SSD.
[19] Christopher Ré,et al. Efficient Top-k Query Evaluation on Probabilistic Data , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[20] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[21] Hans-Peter Kriegel,et al. Probabilistic Nearest-Neighbor Query on Uncertain Objects , 2007, DASFAA.
[22] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[23] Ralf Hartmut Güting,et al. Supporting uncertainty in moving objects in network databases , 2005, GIS '05.
[24] Seung-won Hwang,et al. Minimal probing: supporting expensive predicates for top-k queries , 2002, SIGMOD '02.
[25] John Geweke,et al. Efficient Simulation from the Multivariate Normal and Student-t Distributions Subject to Linear Constraints and the Evaluation of Constraint Probabilities , 1991 .
[26] M. Bauer,et al. Estimation and mapping of forest stand density, volume, and cover type using the k-nearest neighbors method , 2001 .
[27] Yufei Tao,et al. Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions , 2005, VLDB.
[28] Hanqing Lu,et al. Occlusion Robust Face Recognition with Dynamic Similarity Features , 2006, 18th International Conference on Pattern Recognition (ICPR'06).