Cui Yu

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
16Routing and wavelength assignment for 3-ary n-cube in array-based optical network. Cui Yu, Xiaofan Yang, Luxing Yang, Jing Zhang. Inf. Process. Lett. (112): 252-256 (2012). Web SearchBibTeXDownload
2011
15Can the transition from tunneling to hopping in molecular junctions be predicted by theoretical calculation?. Hongmei Liu, Zhenzhen Zhao, Nan Wang, Cui Yu, Jianwei Zhao. Journal of Computational Chemistry (32): 1687-1693 (2011). Web SearchBibTeXDownload
2010
14High-dimensional kNN joins with incremental updates. Cui Yu, Rui Zhang, Yaochun Huang, Hui Xiong. GeoInformatica (14): 55-82 (2010). Web SearchBibTeXDownload
13Enhancing the B+-tree by dynamic node popularity caching. Cui Yu, James Bailey, Julian Montefusco, Rui Zhang, Jiling Zhong. Inf. Process. Lett. (110): 268-273 (2010). Web SearchBibTeXDownload
2007
12Efficient index-based KNN join processing for high-dimensional data. Cui Yu, Bin Cui, Shuguang Wang, Jianwen Su. Information & Software Technology (49): 332-344 (2007). Cited by 6Web SearchBibTeXDownload
2006
11Exploring composite acoustic features for efficient music similarity query. Bin Cui, Jialie Shen, Gao Cong, Heng Tao Shen, Cui Yu. ACM Multimedia 2006, 412-420. Cited by 8Web SearchBibTeXDownload
10Multi-Projector Seamless Display System Based on PC-Cluster. Lingyun Yu, Cui Yu, Yigang Wang. ICAT Workshops 2006, 125-130. Web SearchBibTeXDownload
2005
9iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. H. V. Jagadish, Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Rui Zhang. ACM Trans. Database Syst. (30): 364-397 (2005). Cited by 133Web SearchBibTeXDownload
2004
8Adaptive Quantization of the High-Dimensional Data for Efficient KNN Processing. Bin Cui, Jing Hu, Heng Tao Shen, Cui Yu. DASFAA 2004, 302-313. Cited by 5Web SearchBibTeXDownload
7Querying high-dimensional data in single-dimensional space. Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee Tan. VLDB J. (13): 105-119 (2004). Cited by 15Web SearchBibTeXDownload
2003
6An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing. Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoying Zhou. ICDE 2003, 87-98. Cited by 39Web SearchBibTeXDownload
2002
5Fast Filter-and-Refine Algorithms for Subsequence Selection. Beng Chin Ooi, HweeHwa Pang, Hao Wang, Limsoon Wong, Cui Yu. IDEAS 2002, 243-255. Cited by 4Web SearchBibTeXDownload
4Frequent Update and Efficient Retrieval: an Oxymoron on Moving Object Indexes?. Beng Chin Ooi, Kian-Lee Tan, Cui Yu. WISE Workshops 2002, 3-12. Cited by 19Web SearchBibTeXDownload
2001
3Indexing the Distance: An Efficient Method to KNN Processing. Cui Yu, Beng Chin Ooi, Kian-Lee Tan, H. V. Jagadish. VLDB 2001, 421-430. Cited by 165Web SearchBibTeXDownload
2Compressing the Index - A Simple and yet Efficient Approximation Approach to High-Dimensional Indexing. Shuguang Wang, Cui Yu, Beng Chin Ooi. WAIM 2001, 291-304. Web SearchBibTeXDownload
2000
1Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing. Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stéphane Bressan. PODS 2000, 166-174. Cited by 46Web SearchBibTeX
from DBLP and Google Scholar
References
1. ^ VLDB 2005 * Demonstrations Program Committee - Retrieved 2011-04-18 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research