| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Bin Cui Gao Cong , Bin Cui, Yingxin Li , Zonghong Zhang : Summarizing Frequent Patterns Using Profiles. DASFAA 2006 : 171-186 Jialie Shen , John Shepherd , Bin Cui, Kian-Lee Tan : HSI: A Novel Framework for Efficient Automated Singer Identification in Large Music Database. ICDE 2006 : 169 Lidan Shou , Bin Cui, Gang Chen , Jinxiang Dong : Classifying E-Mails Via Support Vector Machine. WAIM 2006 : 422-434 Bin Cui, Heng Tao Shen , Jialie Shen , Kian-Lee Tan : Exploring Bit-Difference for Approximate KNN Search in High-dimensional Databases. ADC 2005 : 165-174 Heng Tao Shen , Xiaofang Zhou , Bin Cui: Indexing Text and Visual Features for WWW Images. APWeb 2005 : 885-899 Bin Cui, Dan Lin , Kian-Lee Tan : Towards Optimal Utilization of Main Memory for Moving Object Indexing. DASFAA 2005 : 600-611 Bin Cui, Anirban Mondal , Jialie Shen , Gao Cong , Kian-Lee Tan : On Effective E-mail Classification via Neural Networks. DEXA 2005 : 85-94 Bin Cui, Beng Chin Ooi , Jianwen Su , Kian-Lee Tan : Indexing High-Dimensional Data for Efficient In-Memory Similarity Search. IEEE Trans. Knowl. Data Eng. 17 (3): 339-353 (2005) Jing Hu , Bin Cui, Heng Tao Shen : Diagonal Ordering: A New Approach to High-Dimensional KNN Processing. ADC 2004 : 39-47 Bin Cui, Jing Hu , Heng Tao Shen , Cui Yu : Adaptive Quantization of the High-Dimensional Data for Efficient KNN Processing. DASFAA 2004 : 302-313 Bin Cui, Beng Chin Ooi , Jianwen Su , Kian-Lee Tan : Main Memory Indexing: The Case for BD-Tree. IEEE Trans. Knowl. Data Eng. 16 (7): 870-874 (2004) Bin Cui, Beng Chin Ooi , Jianwen Su , Kian-Lee Tan : Contorting High Dimensional Data for Efficient Main Memory Processing. SIGMOD Conference 2003 : 479-490 Mong-Li Lee , Wynne Hsu , Christian S. Jensen , Bin Cui, Keng Lik Teo : Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. VLDB 2003 : 608-619 Zhong Wei Luo , Tok Wang Ling , Chuan-Heng Ang , Sin Yeung Lee , Bin Cui: Range Top/Bottom k Queries in OLAP Sparse Data Cubes. DEXA 2001 : 678-687 1 [ 1 ] 2 [ 12 ] 3 [ 8 ] [ 14 ] 4 [ 12 ] 5 [ 2 ] 6 [ 5 ] [ 6 ] 7 [ 2 ] 8 [ 2 ] 9 [ 1 ] 10 [ 14 ] 11 [ 9 ] 12 [ 1 ] 13 [ 1 ] 14 [ 8 ] 15 [ 3 ] [ 4 ] [ 7 ] 16 [ 5 ] [ 6 ] [ 10 ] [ 11 ] 17 [ 8 ] [ 11 ] [ 13 ] 18 [ 13 ] 19 [ 12 ] 20 [ 3 ] [ 4 ] [ 7 ] 21 [ 3 ] [ 4 ] [ 7 ] [ 8 ] [ 9 ] [ 11 ] [ 13 ] 22 [ 2 ] 23 [ 5 ] 24 [ 14 ] 25 [ 10 ]  ©2006 Association for Computing Machinery |
