A comparison of algorithms for data base compression by use of fragments as language elements
暂无分享,去创建一个
[1] E. F. Moore,et al. Variable-length binary encodings , 1959 .
[2] Robert A. Wagner,et al. Binary Pattern Reconstruction from Projections [Z] (Algorithm 445) , 1973, Communications of the ACM.
[3] William R. Nugent,et al. AUTOMATIC WORD CODING TECHNIQUES FOR COMPUTER LANGUAGE PROCESSING. SAMPLE RESULTS OF COMPUTER TESTS , 1962 .
[4] J. J. Dimsdale,et al. File Structure for an On-Line Catalog of One Million Titles , 1973 .
[5] H. S. Heaps,et al. Selection of equifrequent word fragments for information retrieval , 1973, Inf. Storage Retr..
[6] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[7] Michael F. Lynch,et al. The identification of variable-length, equifrequent character strings in a natural language data base , 1972, Comput. J..
[8] George Kingsley Zipf,et al. Human behavior and the principle of least effort , 1949 .
[9] H. S. Heaps. Storage Analysis Of A Compression Coding For Document Data Bases , 1972 .
[10] Larry H. Thiel,et al. Program design for retrospective searches on large data bases , 1972, Inf. Storage Retr..
[11] T. A. J. Nicholson,et al. Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..
[12] Larry H. Thiel,et al. Optimum procedures for economic information retrieval , 1970, Inf. Storage Retr..