![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Zaiqing Nie Zaiqing Nie, Fei Wu , Ji-Rong Wen , Wei-Ying Ma : Extracting Objects from the Web. ICDE 2006 : 123 Jun Zhu , Zaiqing Nie, Ji-Rong Wen , Bo Zhang , Wei-Ying Ma : 2D Conditional Random Fields for Web information extraction. ICML 2005 : 1044-1051 Zaiqing Nie, Yuanzhi Zhang , Ji-Rong Wen , Wei-Ying Ma : Object-level ranking: bringing order to Web objects. WWW 2005 : 567-574 Zaiqing Nie, Subbarao Kambhampati , Ullas Nambiar : Effectively Mining and Using Coverage and Overlap Statistics for Data Integration. IEEE Trans. Knowl. Data Eng. 17 (5): 638-651 (2005) Zaiqing Nie, Subbarao Kambhampati : A Frequency-based Approach for Mining Coverage Statistics in Data Integration. ICDE 2004 : 387-398 Subbarao Kambhampati , Eric Lambrecht , Ullas Nambiar , Zaiqing Nie, Senthil Gnanaprakasam : Optimizing Recursive Information Gathering Plans in EMERAC. J. Intell. Inf. Syst. 22 (2): 119-153 (2004) Zaiqing Nie, Subbarao Kambhampati : Frequency-Based Coverage Statistics Mining for Data Integration. IIWeb 2003 : 123-128 Zaiqing Nie, Subbarao Kambhampati , Thomas Hernandez : BibFinder/StatMiner: Effectively Mining and Using Coverage and Overlap Statistics in Data Integration. VLDB 2003 : 1097-1100 Zaiqing Nie, Ullas Nambiar , Sreelakshmi Vaddi , Subbarao Kambhampati : Mining coverage statistics for websource selection in a mediator. CIKM 2002 : 678-680 Zaiqing Nie, Subbarao Kambhampati : Joint Optimization of Cost and Coverage of Query Plans in Data Integration. CIKM 2001 : 223-230 Zaiqing Nie, Subbarao Kambhampati , Ullas Nambiar , Sreelakshmi Vaddi : Mining source coverage statistics for data integration. WIDM 2001 : 1-8 1 [ 6 ] 2 [ 4 ] 3 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] 4 [ 6 ] 5 [ 9 ] [ 10 ] [ 11 ] 6 [ 1 ] [ 3 ] [ 6 ] [ 8 ] 7 [ 1 ] [ 3 ] 8 [ 9 ] [ 10 ] [ 11 ] 9 [ 11 ] 10 [ 10 ] 11 [ 9 ] 12 [ 10 ] ![]() ©2006 Association for Computing Machinery |