Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Xuemin Lin
2010 – today
- 2013
[j60]Qing Liu, Xiang Zhao, Kerry Taylor, Xuemin Lin, Geoffrey Squire, Corne Kloppers, Richard Miller: Towards semantic comparison of multi-granularity process traces. Knowl.-Based Syst. 52: 91-106 (2013)- [j59]Jianmin Wang, Shaoxu Song, Xiaochen Zhu, Xuemin Lin: Efficient Recovery of Missing Events. PVLDB 6(10): 841-852 (2013)
- [j58]Weiren Yu, Xuemin Lin, Wenjie Zhang, Lijun Chang, Jian Pei: More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks. PVLDB 7(1): 13-24 (2013)
- [j57]Bin Jiang, Jian Pei, Yufei Tao, Xuemin Lin: Clustering Uncertain Data Based on Probability Distribution Similarity. IEEE Trans. Knowl. Data Eng. 25(4): 751-763 (2013)
- [j56]Wei Wang, Jianbin Qin, Chuan Xiao, Xuemin Lin, Heng Tao Shen: VChunkJoin: An Efficient Algorithm for Edit Similarity Joins. IEEE Trans. Knowl. Data Eng. 25(8): 1916-1929 (2013)
- [j55]Jianbin Qin, Wei Wang, Chuan Xiao, Yifei Lu, Xuemin Lin, Haixun Wang: Asymmetric signature schemes for efficient exact edit similarity query processing. ACM Trans. Database Syst. 38(3): 16 (2013)
- [j54]Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin: High efficiency and quality: large graphs matching. VLDB J. 22(3): 345-368 (2013)
- [j53]Qianlu Lin, Ying Zhang, Wenjie Zhang, Xuemin Lin: Efficient general spatial skyline computation. World Wide Web 16(3): 247-270 (2013)
- [c117]Qianlu Lin, Ying Zhang, Wenjie Zhang, Xuemin Lin: AVR-Tree: Speeding Up the NN and ANN Queries on Location Data. DASFAA (1) 2013: 116-130
- [c116]Xiang Zhao, Haichuan Shang, Wenjie Zhang, Xuemin Lin, Weidong Xiao: On Efficient Graph Substructure Selection. DASFAA (2) 2013: 284-300
- [c115]Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Ying Zhang: A safe zone based approach for monitoring moving skyline queries. EDBT 2013: 275-286
- [c114]Qing Zhang, Pengjie Ye, Xuemin Lin, Ying Zhang: Skyline probability over uncertain preferences. EDBT 2013: 395-405
- [c113]Weiren Yu, Xuemin Lin, Wenjie Zhang: Towards efficient SimRank computation on large networks. ICDE 2013: 601-612
- [c112]Chengyuan Zhang, Ying Zhang, Wenjie Zhang, Xuemin Lin: Inverted linear quadtree: Efficient top k spatial keyword search. ICDE 2013: 901-912
- [c111]Ming Gao, Cheqing Jin, Wei Wang, Xuemin Lin, Aoying Zhou: Similarity query processing for probabilistic sets. ICDE 2013: 913-924
- [c110]Yang Wang, Muhammad Aamir Cheema, Xuemin Lin, Qing Zhang: Multi-Manifold Ranking: Using Multiple Features for Better Image Retrieval. PAKDD (2) 2013: 449-460
- [c109]
- [c108]Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, Xuemin Lin: I/O efficient: computing SCCs in massive graphs. SIGMOD Conference 2013: 181-192
- [c107]Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, Weifa Liang: Efficiently computing k-edge connected components via graph decomposition. SIGMOD Conference 2013: 205-216
- [c106]Qing Liu, Kerry Taylor, Xiang Zhao, Geoffrey Squire, Xuemin Lin, Corne Kloppers, Richard Miller: CTrace: semantic comparison of multi-granularity process traces. SIGMOD Conference 2013: 1121-1124
- [e9]Xuemin Lin, Yannis Manolopoulos, Divesh Srivastava, Guangyan Huang (Eds.): Web Information Systems Engineering - WISE 2013 - 14th International Conference, Nanjing, China, October 13-15, 2013, Proceedings, Part I. Lecture Notes in Computer Science 8180, Springer 2013, ISBN 978-3-642-41229-5
- [e8]Xuemin Lin, Yannis Manolopoulos, Divesh Srivastava, Guangyan Huang (Eds.): Web Information Systems Engineering - WISE 2013 - 14th International Conference, Nanjing, China, October 13-15, 2013, Proceedings, Part II. Lecture Notes in Computer Science 8181, Springer 2013, ISBN 978-3-642-41153-3
- 2012
- [j52]Yang Wang, Lin Wu, Xiaodi Huang, Xuemin Lin: Human Action Recognition from Video Sequences by Enforcing Tri-view Constraints. Comput. J. 55(9): 1030-1040 (2012)
- [j51]Chunyang Ma, Rui Zhang, Xuemin Lin, Gang Chen: DuoWave: Mitigating the curse of dimensionality for uncertain data. Data Knowl. Eng. 76: 16-38 (2012)
- [j50]Bin Jiang, Jian Pei, Xuemin Lin, Yidong Yuan: Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods. J. Intell. Inf. Syst. 38(1): 1-39 (2012)
- [j49]Ying Zhang, Xuemin Lin, Yufei Tao, Wenjie Zhang, Haixun Wang: Efficient Computation of Range Aggregates against Uncertain Location-Based Queries. IEEE Trans. Knowl. Data Eng. 24(7): 1244-1258 (2012)
- [j48]Wenjie Zhang, Xuemin Lin, Ying Zhang, Muhammad Aamir Cheema, Qing Zhang: Stochastic skylines. ACM Trans. Database Syst. 37(2): 14 (2012)
- [j47]Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin, Ying Zhang, Xuefei Li: Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks. VLDB J. 21(1): 69-95 (2012)
- [j46]Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin, Ying Zhang: Efficiently processing snapshot and continuous reverse k nearest neighbors queries. VLDB J. 21(5): 703-728 (2012)
- [j45]Weiren Yu, Wenjie Zhang, Xuemin Lin, Qing Zhang, Jiajin Le: A space and time efficient algorithm for SimRank computation. World Wide Web 15(3): 327-353 (2012)
- [c105]Liming Zhan, Ying Zhang, Wenjie Zhang, Xuemin Lin: Finding top k most influential spatial facilities over uncertain objects. CIKM 2012: 922-931
- [c104]Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin: Loyalty-based selection: retrieving objects that persistently satisfy criteria. CIKM 2012: 2189-2193
- [c103]Gaoping Zhu, Ke Zhu, Wenjie Zhang, Xuemin Lin, Chuan Xiao: Efficient Subgraph Similarity All-Matching. DASFAA (1) 2012: 455-469
- [c102]Wenjie Zhang, Jing Xu, Xin Liang, Ying Zhang, Xuemin Lin: Top-k Similarity Join over Multi-valued Objects. DASFAA (1) 2012: 509-525
- [c101]Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin: Effectively indexing the multi-dimensional uncertain objects for range searching. EDBT 2012: 504-515
- [c100]Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Haixun Wang: Efficiently Monitoring Top-k Pairs over Sliding Windows. ICDE 2012: 798-809
- [c99]Xiang Zhao, Chuan Xiao, Xuemin Lin, Wei Wang: Efficient Graph Similarity Joins with Edit Distance Constraints. ICDE 2012: 834-845
- [c98]Weiren Yu, Xuemin Lin, Wenjie Zhang, Ying Zhang, Jiajin Le: SimFusion+: extending simfusion towards efficient estimation on large and dynamic networks. SIGIR 2012: 365-374
- [c97]Gaoping Zhu, Xuemin Lin, Ke Zhu, Wenjie Zhang, Jeffrey Xu Yu: TreeSpan: efficiently computing similarity all-matching. SIGMOD Conference 2012: 529-540
- [c96]Weiren Yu, Jiajin Le, Xuemin Lin, Wenjie Zhang: On the Efficiency of Estimating Penetrating Rank on Large Graphs. SSDBM 2012: 231-249
- [c95]Jianbin Qin, Chuan Xiao, Wei Wang, Xuemin Lin: A Space-Efficient Indexing Algorithm for Boolean Query Processing. WISE 2012: 638-644
- 2011
- [j44]Ying Zhang, Wenjie Zhang, Xuemin Lin, Bin Jiang, Jian Pei: Ranking uncertain sky: The probabilistic top-k skyline operator. Inf. Syst. 36(5): 898-915 (2011)
- [j43]Keqiu Li, Laurence Tianruo Yang, Xuemin Lin: Advanced topics in cloud computing. J. Network and Computer Applications 34(4): 1033-1034 (2011)
- [j42]Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin Lin, Wenjie Zhang, Wei Wang: Continuous Monitoring of Distance-Based Range Queries. IEEE Trans. Knowl. Data Eng. 23(8): 1182-1199 (2011)
- [j41]Yi Luo, Wei Wang, Xuemin Lin, Xiaofang Zhou, Jianmin Wang, Keqiu Li: SPARK2: Top-k Keyword Query in Relational Databases. IEEE Trans. Knowl. Data Eng. 23(12): 1763-1780 (2011)
- [j40]Chuan Xiao, Wei Wang, Xuemin Lin, Jeffrey Xu Yu, Guoren Wang: Efficient similarity joins for near-duplicate detection. ACM Trans. Database Syst. 36(3): 15 (2011)
- [j39]
- [c94]Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin: High efficiency and quality: large graphs matching. CIKM 2011: 1755-1764
- [c93]Mahady Hasan, Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang: A Unified Algorithm for Continuous Monitoring of Spatial Queries. DASFAA (2) 2011: 104-118
- [c92]Ke Zhu, Wenjie Zhang, Gaoping Zhu, Ying Zhang, Xuemin Lin: BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries. DASFAA (1) 2011: 434-449
- [c91]Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Ying Zhang: Influence zone: Efficiently processing reverse k nearest neighbors queries. ICDE 2011: 577-588
- [c90]Xuemin Lin, Ying Zhang, Wenjie Zhang, Muhammad Aamir Cheema: Stochastic skyline operator. ICDE 2011: 721-732
- [c89]Muhammad Aamir Cheema, Xuemin Lin, Haixun Wang, Jianmin Wang, Wenjie Zhang: A unified approach for computing top-k pairs in multidimensional space. ICDE 2011: 1031-1042
- [c88]Jianbin Qin, Wei Wang, Yifei Lu, Chuan Xiao, Xuemin Lin: Efficient exact edit similarity query processing with the asymmetric signature scheme. SIGMOD Conference 2011: 1033-1044
- [c87]Peng Peng, Lei Zou, Lei Chen, Xuemin Lin, Dongyan Zhao: Subgraph Search over Massive Disk Resident Graphs. SSDBM 2011: 312-321
- 2010
- [j38]Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsuregawa, Xiaofang Zhou, Jeffrey Xu Yu: Duplicate-Insensitive Order Statistics Computation over Data Streams. IEEE Trans. Knowl. Data Eng. 22(4): 493-507 (2010)
- [j37]Muhammad Aamir Cheema, Xuemin Lin, Wei Wang, Wenjie Zhang, Jian Pei: Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data. IEEE Trans. Knowl. Data Eng. 22(4): 550-564 (2010)
- [j36]Ying Zhang, Xuemin Lin, Wenjie Zhang, Jianmin Wang, Qianlu Lin: Effectively Indexing the Uncertain Space. IEEE Trans. Knowl. Data Eng. 22(9): 1247-1261 (2010)
- [j35]Wenjie Zhang, Xuemin Lin, Ying Zhang, Jian Pei, Wei Wang: Threshold-based probabilistic top-k dominating queries. VLDB J. 19(2): 283-305 (2010)
- [j34]Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin: Sliding-window top-k queries on uncertain streams. VLDB J. 19(3): 411-435 (2010)
- [c86]Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, Xuemin Lin: Counting distinct objects over sliding windows. ADC 2010: 75-84
- [c85]Weiren Yu, Xuemin Lin, Jiajin Le: A Space and Time Efficient Algorithm for SimRank Computation. APWeb 2010: 164-170
- [c84]Ke Zhu, Ying Zhang, Xuemin Lin, Gaoping Zhu, Wei Wang: NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs. DASFAA (1) 2010: 140-154
- [c83]Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xuemin Lin: Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries. DASFAA (1) 2010: 233-249
- [c82]Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin: Probabilistic ranking over relations. EDBT 2010: 477-488
- [c81]Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Ying Zhang, Wei Wang: Quantile-based KNN over multi-valued objects. ICDE 2010: 16-27
- [c80]Ying Zhang, Xuemin Lin, Gaoping Zhu, Wenjie Zhang, Qianlu Lin: Efficient rank based KNN query processing over uncertain data. ICDE 2010: 28-39
- [c79]Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin Lin, Wenjie Zhang, Wei Wang: Multi-guarded safe zone: An effective technique to monitor moving circular range queries. ICDE 2010: 189-200
- [c78]Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ryutaro Ichise: Similarity search on supergraph containment. ICDE 2010: 637-648
- [c77]Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu Yu, Wei Wang: Connected substructure similarity search. SIGMOD Conference 2010: 903-914
- [c76]Chaokun Wang, Jianmin Wang, Xuemin Lin, Wei Wang, Haixun Wang, Hongsong Li, Wanpeng Tian, Jun Xu, Rui Li: MapDupReducer: detecting near duplicates over massive datasets. SIGMOD Conference 2010: 1119-1122
- [c75]Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, Haichuan Shang: PrefIndex: An Efficient Supergraph Containment Search Technique. SSDBM 2010: 360-378
- [c74]
2000 – 2009
- 2009
- [j33]Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei Wang, Wenjie Zhang: Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN. PVLDB 2(1): 1138-1149 (2009)
- [j32]Ming Hua, Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Ho-Fung Leung: Top-k typicality queries and efficient query answering methods on large databases. VLDB J. 18(3): 809-835 (2009)
- [c73]
- [c72]
- [c71]Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Wang, Jeffrey Xu Yu: Probabilistic Skyline Operator over Sliding Windows. ICDE 2009: 1060-1071
- [c70]Ying Zhang, Xuemin Lin, Yufei Tao, Wenjie Zhang: Uncertain Location Based Range Aggregates in a Multi-dimensional Space. ICDE 2009: 1247-1250
- [c69]Wei Wang, Chuan Xiao, Xuemin Lin, Chengqi Zhang: Efficient approximate entity extraction with edit distance constraints. SIGMOD Conference 2009: 759-770
- [c68]Yi Chen, Wei Wang, Ziyang Liu, Xuemin Lin: Keyword search on structured and semi-structured data. SIGMOD Conference 2009: 1005-1010
- [c67]Mahady Hasan, Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang: Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets. SSTD 2009: 373-379
- [c66]Shuxiang Yang, Wenjie Zhang, Ying Zhang, Xuemin Lin: Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data. APWeb/WAIM 2009: 51-62
- [e7]Athman Bouguettaya, Xuemin Lin (Eds.): Database Technologies 2009, Twentieth Australasian Database Conference (ADC 2009), Wellington, New Zealand, 20-23 January, 2009, Proceedings. CRPIT 92, Australian Computer Society 2009, ISBN 978-1-920682-73-6
- [r1]
- 2008
- [j31]Bin Wang, Xiaochun Yang, Guoren Wang, Ge Yu, Lei Chen, Xiaoyang Sean Wang, Xuemin Lin: Continually Answering Constraint k - NN Queries in Unstructured P2P Systems. J. Comput. Sci. Technol. 23(4): 538-556 (2008)
- [j30]Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin: Sliding-window top-k queries on uncertain streams. PVLDB 1(1): 301-312 (2008)
- [j29]Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1): 364-375 (2008)
- [j28]Chuan Xiao, Wei Wang, Xuemin Lin: Ed-Join: an efficient algorithm for similarity joins with edit distance constraints. PVLDB 1(1): 933-944 (2008)
- [j27]Ke Deng, Xiaofang Zhou, Heng Tao Shen, Qing Liu, Kai Xu, Xuemin Lin: A multi-resolution surface distance model for k-NN query processing. VLDB J. 17(5): 1101-1119 (2008)
- [j26]Hongzhi Wang, Jianzhong Li, Wei Wang, Xuemin Lin: Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document. World Wide Web 11(4): 485-510 (2008)
- [c65]
- [c64]Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, Philip S. Yu: Fast computing reachability labelings for large graphs with high compression rate. EDBT 2008: 193-204
- [c63]Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin: Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data. ICDE 2008: 1403-1405
- [c62]
- [c61]Zheng Liu, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin, Lei Chen: Spotting Significant Changing Subgraphs in Evolving Graphs. ICDM 2008: 917-922
- [c60]Bin Jiang, Jian Pei, Xuemin Lin, David W. Cheung, Jiawei Han: Mining preferences from superior and inferior examples. KDD 2008: 390-398
- [c59]Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin: Ranking queries on uncertain data: a probabilistic threshold approach. SIGMOD Conference 2008: 673-686
- [c58]Jian Pei, Ming Hua, Yufei Tao, Xuemin Lin: Query answering techniques on uncertain and probabilistic data: tutorial summary. SIGMOD Conference 2008: 1357-1364
- [c57]Wenjie Zhang, Xuemin Lin, Jian Pei, Ying Zhang: Managing Uncertain Data: Probabilistic Approaches. WAIM 2008: 405-412
- [c56]Chuan Xiao, Wei Wang, Xuemin Lin, Jeffrey Xu Yu: Efficient similarity joins for near duplicate detection. WWW 2008: 131-140
- [e6]Alan Fekete, Xuemin Lin (Eds.): Database Technologies 2008. Proceedings of the Nineteenth Australasian Database Conference, ADC 2008, January 22-25, 2008, Wollongong, NSW, Australia. CRPIT 75, Australian Computer Society 2008, ISBN 978-1-920682-56-9
- [e5]Paolo Missier, Xuemin Lin, Ander de Keijzer, Maurice van Keulen (Eds.): Proceedings of the International Workshop on Quality in Databases and Management of Uncertain Data, Auckland, New Zealand, August 2008. 2008
- 2007
- [j25]Xuemin Lin, Qing Zhang, Yidong Yuan, Qing Liu: Error minimization in approximate range aggregates. Data Knowl. Eng. 62(1): 156-176 (2007)
- [c55]
- [c54]Muhammad Aamir Cheema, Yidong Yuan, Xuemin Lin: CircularTrip: An Effective Algorithm for Continuous k NN Queries. DASFAA 2007: 863-869
- [c53]Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang: Selecting Stars: The k Most Representative Skyline Operator. ICDE 2007: 86-95
- [c52]Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang: Computing Compressed Multidimensional Skyline Cubes Efficiently. ICDE 2007: 96-105
- [c51]Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, Xuemin Lin: Finding Top-k Min-Cost Connected Trees in Databases. ICDE 2007: 836-845
- [c50]Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsuregawa, Xiaofang Zhou, Jeffrey Xu Yu: Summarizing Order Statistics over Data Streams with Duplicates. ICDE 2007: 1329-1333
- [c49]Yi Luo, Xuemin Lin, Wei Wang, Xiaofang Zhou: Spark: top-k keyword query in relational databases. SIGMOD Conference 2007: 115-126
- [c48]Jian Pei, Bin Jiang, Xuemin Lin, Yidong Yuan: Probabilistic Skylines on Uncertain Data. VLDB 2007: 15-26
- [c47]Ming Hua, Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Ho-fung Leung: Efficiently Answering Top-k Typicality Queries on Large Databases. VLDB 2007: 890-901
- [e4]Guozhu Dong, Xuemin Lin, Wei Wang, Yun Yang, Jeffrey Xu Yu (Eds.): Advances in Data and Web Management, Joint 9th Asia-Pacific Web Conference, APWeb 2007, and 8th International Conference, on Web-Age Information Management, WAIM 2007, Huang Shan, China, June 16-18, 2007, Proceedings. Lecture Notes in Computer Science 4505, Springer 2007, ISBN 978-3-540-72483-4
- 2006
- [j24]Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica 44(1): 1-32 (2006)
- [j23]Zhihong Chong, Jeffrey Xu Yu, Zhengjie Zhang, Xuemin Lin, Wei Wang, Aoying Zhou: Efficient Computation of k-Medians over Data Streams Under Memory Constraints. J. Comput. Sci. Technol. 21(2): 284-296 (2006)
- [j22]Xuemin Lin, Jian Xu, Qing Zhang, Hongjun Lu, Jeffrey Xu Yu, Xiaofang Zhou, Yidong Yuan: Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams. IEEE Trans. Knowl. Data Eng. 18(5): 683-698 (2006)
- [j21]Kai Xu, Xiaofang Zhou, Xuemin Lin, Heng Tao Shen, Ke Deng: A Multiresolution Terrain Model for Efficient Visualization Query Processing. IEEE Trans. Knowl. Data Eng. 18(10): 1382-1396 (2006)
- [j20]Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou, Hongjun Lu: Summarizing level-two topological relations in large spatial datasets. ACM Trans. Database Syst. 31(2): 584-630 (2006)
- [j19]Jian Pei, Yidong Yuan, Xuemin Lin, Wen Jin, Martin Ester, Qing Liu, Wei Wang, Yufei Tao, Jeffrey Xu Yu, Qing Zhang: Towards multidimensional subspace skyline analysis. ACM Trans. Database Syst. 31(4): 1335-1381 (2006)
- [c46]Bin Wang, Xiaochun Yang, Guoren Wang, Lei Chen, Xiaoyang Sean Wang, Xuemin Lin, Ge Yu: Answering Constrained k-NN Queries in Unstructured P2P Systems. DBISP2P 2006: 397-405
- [c45]Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, Philip S. Yu: Fast Computation of Reachability Labeling for Large Graphs. EDBT 2006: 961-979
- [c44]Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wang: Space-efficient Relative Error Order Sketch over Data Streams. ICDE 2006: 51
- [c43]Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu, Xuemin Lin: Surface k-NN Query Processing. ICDE 2006: 78
- 2005
- [c42]
- [c41]Hongzhi Wang, Wei Wang, Xuemin Lin, Jianzhong Li: Labeling Scheme and Structural Joins for Graph-Structured XML Data. APWeb 2005: 277-289
- [c40]Qing Liu, Xuemin Lin, Yidong Yuan: Summarizing Spatial Relations - A Hybrid Histogram. APWeb 2005: 464-476
- [c39]Hongzhi Wang, Wei Wang, Jianzhong Li, Xuemin Lin, Reymond Wong: Practical Indexing XML Document for Twig Query. ASIAN 2005: 208-222
- [c38]Xuemin Lin, Yidong Yuan, Wei Wang, Hongjun Lu: Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. ICDE 2005: 502-513
- [c37]Zheng Liu, Jeffrey Xu Yu, Xuemin Lin, Hongjun Lu, Wei Wang: Locating Motifs in Time-Series Data. PAKDD 2005: 343-353
- [c36]Wei Wang, Hongzhi Wang, Hongjun Lu, Haifeng Jiang, Xuemin Lin, Jianzhong Li: Efficient Processing of XML Path Queries Using the Disk-based F&B Index. VLDB 2005: 145-156
- [c35]Yidong Yuan, Xuemin Lin, Qing Liu, Wei Wang, Jeffrey Xu Yu, Qing Zhang: Efficient Computation of the Skyline Cube. VLDB 2005: 241-252
- [c34]Hongzhi Wang, Wei Wang, Xuemin Lin, Jianzhong Li: Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document. WAIM 2005: 68-80
- [c33]Yi Luo, Zheng Liu, Xuemin Lin, Wei Wang, Jeffrey Xu Yu: Similarity Search with Implicit Object Features. WAIM 2005: 150-161
- 2004
- [c32]Qing Zhang, Xuemin Lin: Clustering Moving Objects for Spatio-temporal Selectivity Estimation. ADC 2004: 123-130
- [c31]Xuemin Lin, Hongjun Lu, Jian Xu, Jeffrey Xu Yu: Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream. ICDE 2004: 362-373
- [c30]Kai Xu, Xiaofang Zhou, Xuemin Lin: Direct Mesh: a Multiresolution Approach to Terrain Visualization. ICDE 2004: 766-776
- [c29]Jian Xu, Xuemin Lin, Xiaofang Zhou: Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Stream. WAIM 2004: 34-44
- [c28]Yi Luo, Hai-Xin Lu, Xuemin Lin: A Scalable and I/O Optimal Skyline Processing Algorithm. WAIM 2004: 218-228
- [e3]Jeffrey Xu Yu, Xuemin Lin, Hongjun Lu, Yanchun Zhang (Eds.): Advanced Web Technologies and Applications, 6th Asia-Pacific Web Conference, APWeb 2004, Hangzhou, China, April 14-17, 2004, Proceedings. Lecture Notes in Computer Science 3007, Springer 2004, ISBN 3-540-21371-6
- 2003
- [j18]
- [j17]Chengfei Liu, Xuemin Lin, Maria E. Orlowska, Xiaofang Zhou: Confirmation: increasing resource availability for transactional workflows. Inf. Sci. 153: 37-53 (2003)
- [j16]Xuemin Lin, Peter Eades: Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci. 292(3): 679-695 (2003)
- [c27]Hai-Xin Lu, Yi Luo, Xuemin Lin: An Optimal Divide-Conquer Algorithm for 2D Skyline Queries. ADBIS 2003: 46-60
- [c26]Qing Liu, Yidong Yuan, Xuemin Lin: Multi-resolution Algorithms for Building Spatial Histograms. ADC 2003: 145-151
- [c25]Xuemin Lin, Qing Zhang: Error Minimization for Approximate Computation of Range Aggregate. DASFAA 2003: 165-172
- [c24]Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou: Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets. VLDB 2003: 814-825
- 2002
- [j15]
- [c23]
- [c22]
- 2001
- [c21]Jialin Le, Xuemin Lin: On Processing Cycle Query's Strategy for Semistructure Data Model and Its Role in Design. CSCWD 2001: 384-388
- [c20]Chengfei Liu, Maria E. Orlowska, Xuemin Lin, Xiaofang Zhou: Improving Backward Recovery in Workflow Systems. DASFAA 2001: 276-283
- [c19]
- [c18]Xuemin Lin, Xiaomei Zhou, Chengfei Liu, Xiaofang Zhou: Efficiently Computing Weighted Proximity Relationships in Spatial Databases. WAIM 2001: 279-290
- 2000
- [j14]Xuemin Lin: On the computational complexity of edge concentration. Discrete Applied Mathematics 101(1-3): 197-205 (2000)
- [j13]Xuemin Lin, Xiaomei Zhou, Chengfei Liu: Efficient computation of a proximity matching in spatial databases. Data Knowl. Eng. 33(1): 85-102 (2000)
- [j12]Xiaomei Zhou, Xuemin Lin, Chengfei Liu, Jiannong Cao: Spatial Query Processing Using Generalized Filter. Int. J. Cooperative Inf. Syst. 9(1-2): 77-92 (2000)
- [j11]
- [c17]Yijun Li, Xuemin Lin, Chi Ping Tsang: An Efficient Distributed Algorithm for Computing Association Rules. Web-Age Information Management 2000: 109-120
- [e2]Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma (Eds.): Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Lecture Notes in Computer Science 1858, Springer 2000, ISBN 3-540-67787-9
1990 – 1999
- 1999
- [j10]Xuemin Lin, Yijun Li, Chi Ping Tsang: Applying On-line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules. Inf. Sci. 120(1-4): 197-208 (1999)
- [c16]Xuemin Lin, Peter Eades: Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. COCOON 1999: 92-102
- [c15]Xiaofang Zhou, Yanchun Zhang, Xuemin Lin, Chengfei Liu: On the Optimization of Complex Spatial Queries. CODAS 1999: 252-263
- [c14]Chengfei Liu, Maria E. Orlowska, Xiaofang Zhou, Xuemin Lin: Confirmation: A Solution for Non-Compensatability in Workflow Applications. ICDE 1999: 102
- [c13]Xuemin Lin, Xiaomei Zhou, Chengfei Liu: Efficiently Matching Proximity Relationships in Spatial Databases. SSD 1999: 188-206
- [c12]Chengfei Liu, Xuemin Lin, Xiaofang Zhou, Maria E. Orlowska: Building a Repository for Workflow Systems. TOOLS (31) 1999: 348-357
- [c11]Xuemin Lin, Chengfei Liu, Yanchun Zhang, Xiaofang Zhou: Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment. TOOLS (31) 1999: 440-447
- 1998
- [e1]Xuemin Lin (Ed.): Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), Perth, WA, Australia, February 2-3, 1998. Australian Computer Science Communications 20, Springer-Verlag Singapore Pte. Ltd. 1998
- 1997
- [j9]Xuemin Lin: A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead. Theor. Comput. Sci. 185(2): 259-275 (1997)
- [c10]
- [c9]Xuemin Lin, Peter Eades: Area Requirements for Drawing Hierarchically Planar Graphs. Graph Drawing 1997: 219-229
- 1996
- [j8]Peter Eades, Xuemin Lin, Roberto Tamassia: An Algorithm for Drawing a Hierarchical Graph. Int. J. Comput. Geometry Appl. 6(2): 145-156 (1996)
- [j7]Xuemin Lin, Maria E. Orlowska: An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management. J. Parallel Distrib. Comput. 35(1): 97-103 (1996)
- [c8]Peter Eades, Qing-Wen Feng, Xuemin Lin: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Graph Drawing 1996: 113-128
- [c7]Xuemin Lin, Jian Chen: An optimal deadlock resolution algorithm in multidatabase systems. ICPADS 1996: 516-521
- [c6]Xuemin Lin, S. Fox: An effective parallelization of execution of multijoins in multiprocessor systems. ISPAN 1996: 63-69
- 1995
- [j6]Xuemin Lin, Maria E. Orlowska: An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems. Distributed and Parallel Databases 3(1): 69-83 (1995)
- [j5]Xuemin Lin, Maria E. Orlowska: An Integer Linear Programming Approach to Data Allocation with the Minimum Total Communication Cost in Distributed Database Systems. Inf. Sci. 85(1-3): 1-10 (1995)
- [c5]Xuemin Lin, Maria E. Orlowska: A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data. COCOON 1995: 171-180
- 1994
- [c4]Xuemin Lin, Maria E. Orlowska: An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management. ISAAC 1994: 243-251
- 1993
- [j4]Peter Eades, Xuemin Lin, Nicholas C. Wormald: Performance Guarantees for Motion Planning with Temporal Uncertainty. Australian Computer Journal 25(1): 21-28 (1993)
- [j3]Xuemin Lin, Maria E. Orlowska, Yanchun Zhang: A Graph Based Cluster Approach for Vertical Partitioning in Database Design. Data Knowl. Eng. 11(2): 151-169 (1993)
- [j2]Peter Eades, Tao Lin, Xuemin Lin: Two Tree Drawing Conventions. Int. J. Comput. Geometry Appl. 3(2): 133-153 (1993)
- [j1]Peter Eades, Xuemin Lin, W. F. Smyth: A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. 47(6): 319-323 (1993)
- [c3]Xuemin Lin, Yanchun Zhang: A New Graphical Method of Vertical Partitioning in Database Design. Australian Database Conference 1993: 131-144
- [c2]Xuemin Lin, Maria E. Orlowska, Yanchun Zhang: On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design. ICCI 1993: 539-544
- 1992
- [c1]Peter Eades, Tao Lin, Xuemin Lin: Minimum Size h-v Drawings. Advanced Visual Interfaces 1992: 386-394
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-16 21:29 CEST by the dblp team