Top-::::K:::: Probabilistic Closest Pairs Query in Uncertain Spatial Databases - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Mo Chen, Zixi Jia, Yu Gu, Ge Yu. Top-::::K:::: Probabilistic Closest Pairs Query in Uncertain Spatial Databases. In Xiaoyong Du, Wenfei Fan, Jianmin Wang 0001, Zhiyong Peng, Mohamed A. Sharaf, editors, Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Beijing, China, April 18-20, 2011. Proceedings. Volume 6612 of Lecture Notes in Computer Science, pages 53-64, Springer, 2011. [doi]

The following publications are possibly variants of this publication:

Evaluating Probabilistic Spatial-Range Closest Pairs Queries over Uncertain ObjectsMo Chen, Zixi Jia, Yu Gu, Ge Yu, Chuanwen Li. waim 2011: 602-613 [doi]

Probabilistic ranking over relationsLijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin. edbt 2010: 477-488 [doi]

k-Closest Pairs Queries in Crime DatabasesShaojie Qiao, Changjie Tang, Huidong Jin, Shucheng Dai, Xingshu Chen, Michael Chau, Jian Hu. In Christopher C. Yang, Michael Chau, Jau-Hwang Wang, Hsinchun Chen, editors, Security Informatics. Volume 9 of Annals of Information Systems, pages 59-75, Springer, 2010. [doi]

runs on WebDSL