Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Xuemin Lin

Papers on DiSC'04


Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream

Direct Mesh: a Multiresolution Approach to Terrain Visualisation

Publications


Note: Links lead to the DBLP on the Web.

Xuemin Lin

Hongzhi Wang , Wei Wang , Xuemin Lin, Jianzhong Li : Labeling Scheme and Structural Joins for Graph-Structured XML Data. APWeb 2005 : 277-289

Qing Liu , Xuemin Lin, Yidong Yuan : Summarizing Spatial Relations - A Hybrid Histogram. APWeb 2005 : 464-476

Xuemin Lin, Yidong Yuan , Wei Wang , Hongjun Lu : Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. ICDE 2005 : 502-513

Zheng Liu , Jeffrey Xu Yu , Xuemin Lin, Hongjun Lu , Wei Wang : Locating Motifs in Time-Series Data. PAKDD 2005 : 343-353

Jeffrey Xu Yu , Xuemin Lin, Hongjun Lu , Yanchun Zhang : Advanced Web Technologies and Applications, 6th Asia-Pacific Web Conference, APWeb 2004, Hangzhou, China, April 14-17, 2004, Proceedings Springer 2004

Qing Zhang , Xuemin Lin: Clustering Moving Objects for Spatio-temporal Selectivity Estimation. ADC 2004 : 123-130

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-374

Kai Xu , Xiaofang Zhou , Xuemin Lin: Direct Mesh: a Multiresolution Approach to Terrain Visualization. ICDE 2004 : 766-777

Yi Luo , Hai-Xin Lu , Xuemin Lin: A Scalable and I/O Optimal Skyline Processing Algorithm. WAIM 2004 : 218-228

Jian Xu , Xuemin Lin, Xiaofang Zhou : Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Stream. WAIM 2004 : 34-44

Hai-Xin Lu , Yi Luo , Xuemin Lin: An Optimal Divide-Conquer Algorithm for 2D Skyline Queries. ADBIS 2003 : 46-60

Qing Liu , Yidong Yuan , Xuemin Lin: Multi-resolution Algorithms for Building Spatial Histograms. ADC 2003 : 145-151

Xuemin Lin, Qing Zhang : Error Minimization for Approximate Computation of Range Aggregate. DASFAA 2003 : 165-

Xuemin Lin, Qing Liu , Yidong Yuan , Xiaofang Zhou : Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets. VLDB 2003 : 814-825

Xuemin Lin: Delay Optimization in Quorum Consensus. Algorithmica 38 (2): 397-413 (2003)

Chengfei Liu , Xuemin Lin, Maria E. Orlowska , Xiaofang Zhou : Confirmation: increasing resource availability for transactional workflows. Inf. Sci. 153 : 37-53 (2003)

Xuemin Lin, Peter Eades : Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci. 292 (3): 679-695 (2003)

Xuemin Lin, Hai-Xin Lu , Qing Zhang : Graph Partition Based Muti-Way Spatial Joins. IDEAS 2002 : 23-32

Qing Zhang , Xuemin Lin: On Linear-Spline Based Histograms. WAIM 2002 : 354-366

Ding-Zhu Du , Peter Eades , Xuemin Lin: Foreword. Theor. Comput. Sci. 289 (2): 877 (2002)

Chengfei Liu , Maria E. Orlowska , Xuemin Lin, Xiaofang Zhou : Improving Backward Recovery in Workflow Systems. DASFAA 2001 : 276-

Xuemin Lin: Delay Optimizations in Quorum Consensus. ISAAC 2001 : 575-586

Xuemin Lin, Xiaomei Zhou , Chengfei Liu , Xiaofang Zhou : Efficiently Computing Weighted Proximity Relationships in Spatial Databases. WAIM 2001 : 279-290

Ding-Zhu Du , Peter Eades , Vladimir Estivill-Castro , Xuemin Lin, Arun Sharma : Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings Springer 2000

Yijun Li , Xuemin Lin, Chi Ping Tsang : An Efficient Distributed Algorithm for Computing Association Rules. Web-Age Information Management 2000 : 109-120

Xuemin Lin, Xiaomei Zhou , Chengfei Liu : Efficient computation of a proximity matching in spatial databases. Data Knowl. Eng. 33 (1): 85-102 (2000)

Xuemin Lin: On the computational complexity of edge concentration. Discrete Applied Mathematics 101 (1-3): 197-205 (2000)

Xiaomei Zhou , Xuemin Lin, Chengfei Liu , J. Cao : Spatial Query Processing Using Generalized Filter. Int. J. Cooperative Inf. Syst. 9 (1-2): 77-92 (2000)

Peter Eades , Xuemin Lin: Spring algorithms and symmetry. Theor. Comput. Sci. 240 (2): 379-405 (2000)

Xuemin Lin, Peter Eades : Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. COCOON 1999 : 92-102

Xiaofang Zhou , Yanchun Zhang , Xuemin Lin, Chengfei Liu : On the Optimization of Complex Spatial Queries. CODAS 1999 : 252-263

Chengfei Liu , Maria E. Orlowska , Xiaofang Zhou , Xuemin Lin: Confirmation: A Solution for Non-Compensatability in Workflow Applications. ICDE 1999 : 102

Xuemin Lin, Xiaomei Zhou , Chengfei Liu : Efficiently Matching Proximity Relationships in Spatial Databases. SSD 1999 : 188-206

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)

Peter Eades , Xuemin Lin: Spring Algorithms and Symmetry. COCOON 1997 : 202-211

Xuemin Lin, Peter Eades : Area Requirements for Drawing Hierarchically Planar Graphs. Graph Drawing 1997 : 219-229

Xuemin Lin: A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead. Theor. Comput. Sci. 185 (2): 259-275 (1997)

Peter Eades , Qing-Wen Feng , Xuemin Lin: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Graph Drawing 1996 : 113-128

Xuemin Lin, Jian Chen : An optimal deadlock resolution algorithm in multidatabase systems. ICPADS 1996 : 516-521

Xuemin Lin, S. Fox : An effective parallelization of execution of multijoins in multiprocessor systems. ISPAN 1996 : 63-69

Peter Eades , Xuemin Lin, Roberto Tamassia : An Algorithm for Drawing a Hierarchical Graph. Int. J. Comput. Geometry Appl. 6 (2): 145-156 (1996)

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)

Xuemin Lin, Maria E. Orlowska : A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data. COCOON 1995 : 171-180

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)

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)

Xuemin Lin, Maria E. Orlowska : An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management. ISAAC 1994 : 243-251

Xuemin Lin, Yanchun Zhang : A New Graphical Method of Vertical Partitioning in Database Design. Australian Database Conference 1993 : 131-144

Xuemin Lin, Maria E. Orlowska , Yanchun Zhang : On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design. ICCI 1993 : 539-544

Peter Eades , Xuemin Lin, Nicholas C. Wormald : Performance Guarantees for Motion Planning with Temporal Uncertainty. Australian Computer Journal 25 (1): 21-28 (1993)

Xuemin Lin, Maria E. Orlowska , Yanchun Zhang : A Graph Based Cluster Approach for Vertical Partitioning in Database Design. Data Knowl. Eng. 11 (2): 151- (1993)

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)

Peter Eades , Tao Lin , Xuemin Lin: Two Tree Drawing Conventions. Int. J. Comput. Geometry Appl. 3 (2): 133-153 (1993)

Peter Eades , Tao Lin , Xuemin Lin: Minimum Size h-v Drawings. Advanced Visual Interfaces 1992 : 386-394

1 [ 26 ]

2 [ 15 ]

3 [ 30 ] [ 34 ]

4 [ 1 ] [ 2 ] [ 3 ] [ 5 ] [ 13 ] [ 16 ] [ 18 ] [ 19 ] [ 24 ] [ 25 ] [ 30 ] [ 34 ] [ 37 ]

5 [ 30 ]

6 [ 16 ]

7 [ 14 ]

8 [ 53 ]

9 [ 20 ] [ 29 ]

10 [ 1 ] [ 2 ]

11 [ 21 ] [ 22 ] [ 23 ] [ 26 ] [ 28 ] [ 31 ] [ 33 ] [ 38 ]

12 [ 40 ] [ 42 ] [ 52 ]

13 [ 50 ]

14 [ 36 ] [ 43 ] [ 45 ]

15 [ 47 ] [ 49 ] [ 50 ] [ 51 ]

16 [ 43 ] [ 45 ]

17 [ 4 ] [ 6 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 22 ] [ 33 ] [ 38 ]

18 [ 30 ]

19 [ 3 ]

20 [ 13 ]

21 [ 20 ] [ 29 ]

22 [ 53 ]

23 [ 50 ] [ 51 ] [ 53 ]

24 [ 5 ]

25 [ 44 ] [ 47 ]

26 [ 46 ]

27 [ 47 ] [ 49 ] [ 50 ]

28 [ 40 ] [ 42 ] [ 51 ] [ 52 ]

29 [ 35 ] [ 36 ] [ 41 ] [ 48 ]

30 [ 4 ] [ 6 ] [ 7 ] [ 23 ] [ 49 ]

31 [ 22 ] [ 23 ] [ 31 ] [ 33 ] [ 38 ] [ 40 ] [ 44 ] [ 46 ]

32 [ 21 ] [ 26 ] [ 28 ] [ 31 ]




©2005 Association for Computing Machinery