| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Cui Yu H. V. Jagadish , Beng Chin Ooi , Kian-Lee Tan , Cui Yu, Rui Zhang : iDistance: An adaptive B + -tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30 (2): 364-397 (2005) Bin Cui , Jing Hu , Heng Tao Shen , Cui Yu: Adaptive Quantization of the High-Dimensional Data for Efficient KNN Processing. DASFAA 2004 : 302-313 Cui Yu, Stéphane Bressan , Beng Chin Ooi , Kian-Lee Tan : Querying high-dimensional data in single-dimensional space. VLDB J. 13 (2): 105-119 (2004) Hui Jin , Beng Chin Ooi , Heng Tao Shen , Cui Yu, Aoying Zhou : An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing. ICDE 2003 : 87- Cui Yu: High-Dimensional Indexing: Transformational Approaches to High-Dimensional Range and Similarity Searches Springer 2002 Beng Chin Ooi , HweeHwa Pang , Hao Wang , Limsoon Wong , Cui Yu: Fast Filter-and-Refine Algorithms for Subsequence Selection. IDEAS 2002 : 243-255 Beng Chin Ooi , Kian-Lee Tan , Cui Yu: Frequent Update and Efficient Retrieval: an Oxymoron on Moving Object Indexes? WISE Workshops 2002 : 3-12 Cui Yu, Beng Chin Ooi , Kian-Lee Tan , H. V. Jagadish : Indexing the Distance: An Efficient Method to KNN Processing. VLDB 2001 : 421-430 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 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 1 [ 1 ] [ 8 ] 2 [ 9 ] 3 [ 9 ] 4 [ 3 ] [ 10 ] 5 [ 7 ] 6 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 8 ] [ 10 ] 7 [ 5 ] 8 [ 7 ] [ 9 ] 9 [ 1 ] [ 3 ] [ 4 ] [ 8 ] [ 10 ] 10 [ 5 ] 11 [ 2 ] 12 [ 5 ] 13 [ 10 ] 14 [ 7 ]  ©2006 Association for Computing Machinery |
