[1] AL R Y, KARMOUCH A. QoS-Based Composition of Service Specific Overlay Networks[J]. IEEE Transactions on Computers, 2015, 64(3): 832-846.
[2] ZIV J, LEMPEL A. A Universal Algorithm for Sequential Data Compression[J]. IEEE Transactions on Information Theory, 1977, 23(3): 337-343.
[3] CLEARY J G, WITTEN I H. Data Compression Using Adaptive Coding and Partial String Matching[J]. IEEE Transactions on Communications, 1984, 32(4): 396-402.
[4] SHKARIN D. PPM: One Step to Practicality[C]//Data Compression Conference Proceedings: 2002. Piscataway: IEEE, 2002: 202-211.
[5] STEINRUECKEN C, GHAHRAMANI Z, MACKAY D. Improving PPM with Dynamic Parameter Updates[C]//Data Compression Conference Proceedings: 2015. Piscataway: IEEE, 2015: 193-202.
[6] MAHONEY M. Adaptive Weighing of Context Models for Lossless Data Compression[R]. Melbourne: Florida Institute of Technology, 2005.
[7] SEWARD J. On the Performance of BWT Sorting Algorithms[C]//Data Compression Conference Proceedings: 2000. Piscataway: IEEE, 2000: 173-182.
[8] BRISABOA N R, CERDEIRA-PENA A, NAVARRO G. XXS: Efficient XPath Evaluation on Compressed XML Documents[J]. ACM Transactions on Information Systems, 2014, 32(3): 13.
[9] 刘凯, 李云松, 郭杰. 高性能 EBCOT 编码加速算法及其实现结构[J]. 西安电子科技大学学报, 2010, 37(4): 587-593.
LIU Kai, LI Yunsong, GUO Jie. High Performance EBCOT Algorithm and VLSI Architecture[J]. Journal of Xidian University, 2010, 37(4): 587-593.
[10] STRUTZ T. Adaptive Context Formation for Linear Prediction of Image Data[C]//IEEE International Conference on Image Processing. Piscataway: IEEE, 2014: 5631-5635.
[11] STRUTZ T. Entropy Based Merging of Context Models for Efficient Arithmetic Coding[C]//IEEE International Conference on Acoustics, Speech and Signal Processing. Piscataway: IEEE, 2014: 1991-1995.
[12] ACETO G, BOTTA A, PESCAP A, et al. Efficient Storage and Processing of High-volume Network Monitoring Data[J]. IEEE Transactions on Network and Service Management, 2013, 10(2): 162-175. |