![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Cui Yu 3 Cui Yu, Beng Chin Ooi , Kian-Lee Tan , H. V. Jagadish : Indexing the Distance: An Efficient Method to KNN Processing. VLDB 2001 : 421-430 2 Shuguang Wang , Cui Yu, Beng Chin Ooi : Compressing the Index - A Simple and yet Efficient Approximation Approach to High-Dimensional Indexing. WAIM 2001 : 291-304 1 Beng Chin Ooi , Kian-Lee Tan , Cui Yu, Stéphane Bressan : Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing. PODS 2000 : 166-174 ![]() DiSC'02 © 2003 Association for Computing Machinery |