Compression of Digital Road Networks
暂无分享,去创建一个
Gerhard Reinelt | Marcus Oswald | Sungwon Jung | Martin Pfeifle | Jonghyun Suh | Khoa T. Vo | G. Reinelt | M. Oswald | M. Pfeifle | Sungwon Jung | Khoa T. Vo | Jonghyun Suh
[1] Hans-Peter Kriegel,et al. OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.
[2] Juan José Salazar González,et al. Laying Out Sparse Graphs with Provably Minimum Bandwidth , 2005, INFORMS J. Comput..
[3] H. V. Jagadish,et al. Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.
[4] David S. Johnson,et al. COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .
[5] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .
[6] Jiawei Han,et al. CLARANS: A Method for Clustering Objects for Spatial Data Mining , 2002, IEEE Trans. Knowl. Data Eng..
[7] Hans-Peter Kriegel,et al. Visually Mining through Cluster Hierarchies , 2004, SDM.
[8] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[9] Jack A. Orenstein. A comparison of spatial query processing techniques for native and parameter spaces , 1990, SIGMOD '90.
[10] Hugh E. Williams,et al. Compressing Integers for Fast File Access , 1999, Comput. J..
[11] Christos H. Papadimitriou,et al. The NP-Completeness of the bandwidth minimization problem , 1976, Computing.