![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Ken Smith Glenn S. Iwerks , Hanan Samet , Ken Smith: Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. VLDB 2003 : 512-523 Ken Smith, Leo Obrst : Unpacking The Semantics of Source and Usage To Perform Semantic Reconciliation In Large-Scale Information Systems. SIGMOD Record 28 (1): 26-31 (1999) 1 [ 2 ] 2 [ 1 ] 3 [ 2 ] ![]() ©2004 Association for Computing Machinery |