M. E. Gonzales-Smith and J. A. Storer. Parallel algorithms for data compression. Journal of the ACM, 32(2):344--373, April 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Effect of Flexible Parsing for Dynamic Dictionary.. - Matias, Rajpoot.. (Correct)
....be applied on line. However, it usually results in far from optimal parsing compression: for the LZW dictionary method, there are strings T which can be (optimally) parsed to some m phrases, for which the greedy parsing obtains# # phrases ( MS99] a similar result for static dictionaries is in [GSS85]) In [Hor95] it was demonstrated that the compression achieved by LZW algorithm on some standard benchmark files can be improved by looking ahead a few steps. However it was noted that: An optimal parsing scheme would also have to consider the possibility of matching a short first string and ....
M. E. Gonzales-Smith and J. A. Storer. Parallel algorithms for data compression. Journal of the ACM, 32(2):344--373, April 1985.
Data Compression and Database Performance - Graefe, Shapiro (1991) (13 citations) (Correct)
.... [10, 11, 16, 17] Other recent research has considered schemes based on string matching [22, 30, 32, 33] Comprehensive surveys of compression methods and schemes are given in [2, 18, 27] Others have focussed on fast implementation of algorithms, parallel algorithms and VLSI implementations [12, 29]. Few researchers have investigated the effect of compression on database systems and their performance [20, 23, 25] Alsberg considered disk time and space savings by using fixed length minimum bit compression [1] He also points out that more records fit into a page if the records are shorter, ....
M. E. Gonzalez-Smith and J. A. Storer, Parallel Algorithms for Data Compression, J. of the ACM 32, 2 (April 1985), 344.
Lossless Image Compression by Block Matching - Storer, Helfgott (1997) (1 citation) Self-citation (Storer) (Correct)
....presents further practical improvements. The information in the trie can be used as a predictor in a scheme that can be viewed as a generalization of the PPM class of methods [5, 24, 25] Parallel algorithms for lossless compression have been considered previously by many authors (e.g. [6, 11, 26 36]. Applying these and other techniques to 2 D LZ1based compression presents both a theoretical challenge and a practical goal of very high bandwidth compression. THE COMPUTER JOURNAL, Vol. 40, No. 2 3, 1997 LOSSLESS IMAGE COMPRESSION BY BLOCK MATCHING 145 We close by noting that although the ....
Gonzalez, M. and Storer, J. A. (1985) Parallel algorithms for data compression. J. ACM, 32, 344--373.
The Effect of Flexible Parsing for Dynamic - Dictionary Based Data (1999) (Correct)
No context found.
M. E. Gonzales-Smith and J. A. Storer. Parallel algorithms for data compression. Journal of the ACM, 32(2):344--373, April 1985.
Parallel Huffman Decoding with Applications to JPEG Files - Klein, Wiseman (2003) (Correct)
No context found.
Gonzalez Smith, M. E. and Storer, J. A. (1985) Parallel algorithms for data compression. J. ACM, 32(2), 344--373.
Parallel Lempel Ziv Coding - Klein, Wiseman (2005) (Correct)
No context found.
Gonzalez Smith M.E., Storer J.A., Parallel Algorithms for Data Compression, Journal of the ACM 32(2) (1985) 344--373.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC