| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Weining Qian Zhiguo Lu , Bo Ling , Weining Qian, Wee Siong Ng , Aoying Zhou : A Distributed Ranking Strategy in Peer-to-Peer Based Information Retrieval Systems. APWeb 2004 : 279-284 Yi Ren , Chaofeng Sha , Weining Qian, Aoying Zhou , Beng Chin Ooi , Kian-Lee Tan : Explore the "Small World Phenomena" in Pure P2P Information Sharing Systems. CCGRID 2003 : 232-239 Cheqing Jin , Weining Qian, Chaofeng Sha , Jeffrey Xu Yu , Aoying Zhou : Dynamically maintaining frequent items over a data stream. CIKM 2003 : 287-294 Aoying Zhou , Zhiyuan Cai , Li Wei , Weining Qian: M-Kernel Merging: Towards Density Estimation over Data Streams. DASFAA 2003 : 285-292 Linhao Xu , Shuigeng Zhou , Keping Zhao , Weining Qian, Aoying Zhou : PeerBus: A Middleware Framework towards Interoperability among P2P Data Sharing Systems. GCC (1) 2003 : 277-284 Wenyuan Cai , Shuigeng Zhou , Linhao Xu , Weining Qian, Aoying Zhou : C 2 : A New Overlay Network Based on CAN and Chord. GCC (1) 2003 : 42-50 Li Wei , Weining Qian, Aoying Zhou , Wen Jin , Jeffrey Xu Yu : HOT: Hypergraph-Based Outlier Test for Categorical Data. PAKDD 2003 : 399-410 Weining Qian, Shuigeng Zhou , Yi Ren , Aoying Zhou , Beng Chin Ooi , Kian-Lee Tan : Dynamic Clustering-Based Query Answering in Peer-to-Peer Systems. WAIM 2003 : 306-313 Aoying Zhou , Xiong Fang , Weining Qian: An Empirical Study of Learning-Based Web Search. WAIM 2002 : 116-125 Charles X. Ling , Jianfeng Gao , Huajie Zhang , Weining Qian, HongJiang Zhang : Improving Encarta Search Engine Performance by Mining User Logs. IJPRAI 16 (8): 1101-1116 (2002) Charles X. Ling , Jianfeng Gao , Huajie Zhang , Weining Qian, HongJiang Zhang : Mining Generalized Query Patterns from Web Logs. HICSS 2001 Aoying Zhou , Weining Qian, Hailei Qian , Wen Jin , Shuigeng Zhou , Ye Fan : A Hybrid Approach to Clustering in Very Large Databases. PAKDD 2001 : 519-524 Weining Qian, Long Zhang , Yuqi Liang , Hailei Qian , Wen Jin : A Two-Level Method for Clustering DTDs. Web-Age Information Management 2000 : 41-52 1 [ 8 ] 2 [ 10 ] 3 [ 2 ] 4 [ 5 ] 5 [ 3 ] [ 4 ] 6 [ 11 ] 7 [ 1 ] [ 2 ] [ 7 ] 8 [ 1 ] 9 [ 13 ] 10 [ 3 ] [ 4 ] 11 [ 13 ] 12 [ 13 ] 13 [ 6 ] [ 12 ] 14 [ 1 ] [ 2 ] 15 [ 6 ] [ 12 ] 16 [ 11 ] [ 12 ] 17 [ 6 ] [ 12 ] 18 [ 7 ] [ 10 ] 19 [ 8 ] [ 9 ] 20 [ 7 ] [ 11 ] 21 [ 3 ] [ 4 ] 22 [ 3 ] [ 4 ] 23 [ 1 ] 24 [ 9 ] 25 [ 2 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] 26 [ 2 ] [ 6 ] [ 8 ] [ 9 ]  ©2004 Association for Computing Machinery |
