Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Cui Yu

Papers on DiSC'04


Adaptive quantization of the high-dimensional data for efficient KNN processing

Querying high-dimensional data in single-dimensional space

Publications


Note: Links lead to the DBLP on the Web.

Cui Yu

Bin Cui , Jing Hu , Hengtao 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 ]

5 [ 7 ]

6 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 8 ]

7 [ 5 ]

8 [ 7 ]

9 [ 9 ]

10 [ 1 ] [ 3 ] [ 4 ] [ 8 ]

11 [ 5 ]

12 [ 2 ]

13 [ 5 ]

14 [ 7 ]




©2005 Association for Computing Machinery