Suchergebnisse - "universal lossless data compression algorithms"

Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models: Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I: Without context models

Autoren: John C. Kieffer En-hui Yang

Quelle: IEEE Transactions on Information Theory. 49:2874-2894

Schlagwörter: Measures of information, entropy, redundancy, universal lossless data compression algorithms, string matching, entropy rate, 4. Education, 05 social sciences, 0102 computer and information sciences, 02 engineering and technology, Source coding, hierarchical data compression, 01 natural sciences, arithmetic coding, 0508 media and communications, universal sequential data compression, greedy grammar transform, 0202 electrical engineering, electronic engineering, information engineering, Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

Dateibeschreibung: application/xml

Zugangs-URL: https://www.mit.edu/~6.454/www_fall_2002/emin/yang_and_kieffer.pdf
http://ieeexplore.ieee.org/document/841161/
https://dblp.uni-trier.de/db/journals/tit/tit46.html#YangK00
https://ieeexplore.ieee.org/document/1246012/
https://www.cs.brandeis.edu/~dilant/cs175/%5bEric_Collins_2%5d.pdf
https://dl.acm.org/doi/10.1109/18.841161

On the performance of recency-rank and block-sorting universal lossless data compression algorithms

Autoren: Jun Muramatsu

Quelle: 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060). :327

Schlagwörter: Signal theory (characterization, reconstruction, filtering, etc.), 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2167302
https://doi.org/10.1109/tit.2002.801477
https://dblp.uni-trier.de/db/journals/tit/tit48.html#Muramatsu02
https://ieeexplore.ieee.org/document/1027793/

Efficient universal lossless data compression algorithms based on a greedy context-dependent sequential grammar transform

Autoren: En-hui Yang Da-Ke He

Quelle: Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252). :78

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://ieeexplore.ieee.org/document/935941/

On the Performance of Recency-Rank and Block-Sorting Universal Lossless Data Compression Algorithms.

Autoren: Muramatsu, Jun

Quelle: IEEE Transactions on Information Theory. Sep2002, Vol. 48 Issue 9, p2621. 5p.

Schlagwörter: *DATA compression, *ALGORITHMS

Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform--Part One: Without Context Models.

Autoren: Yang, En-hui Kieffer, John C.

Quelle: IEEE Transactions on Information Theory. May2000, Vol. 46 Issue 3, p755. 23p. 4 Diagrams, 6 Charts.

Schlagwörter: *CODING theory, *DATA compression

Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform -- Part One: Without Context Models

Autoren: En-hui Yang John C. Kieffer The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: En-hui Yang John C. Kieffer The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.mit.edu/~6.454/www_fall_2002/emin/yang_and_kieffer.pdf.

Schlagwörter: and

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.9173; http://www.mit.edu/~6.454/www_fall_2002/emin/yang_and_kieffer.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.9173
http://www.mit.edu/~6.454/www_fall_2002/emin/yang_and_kieffer.pdf

Universal Lossless Data Compression Algorithms

Autoren: Sebastian Deorowicz The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Sebastian Deorowicz The Pennsylvania State University CiteSeerX Archives

Quelle: http://www-zo.iinf.polsl.gliwice.pl/~sdeor/pub/deo03.ps.gz.

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.6750

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.6750
http://www-zo.iinf.polsl.gliwice.pl/~sdeor/pub/deo03.ps.gz

Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform--Part Two: With Context Models.

Autoren: En-hui Yang Da-ke He, Kenneth

Quelle: IEEE Transactions on Information Theory; Nov2003, Vol. 49 Issue 11, p2874-2893, 20p

Schlagwörter: CODING theory, DATA compression, ALGORITHMS, INFORMATION theory

Efficient universal lossless data compression algorithms based on a greedy context-dependent sequential grammar transform.

Autoren: En-Hui Yang Da-Ke He

Quelle: Proceedings 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252); 2001, p78-78, 1p

On the performance of recency-rank and block-sorting universal lossless data compression algorithms.

Autoren: Muramatsu, J.

Quelle: 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060); 2000, p327-327, 1p

A crypto-compression system using Spritz algorithm and variable length Encoding algorithm for text files.

Autoren: Sharif, Amer Herriyance Hutabarat, Christine S.

Quelle: AIP Conference Proceedings; 2024, Vol. 2987 Issue 1, p1-9, 9p

Schlagwörter: TEXT files, LOCAL area networks, ALGORITHMS, COMPUTER networks, ENCODING

Building Test Batteries Based on Analyzing Random Number Generator Tests within the Framework of Algorithmic Information Theory.

Autoren: Ryabko, Boris

Quelle: Entropy; Jun2024, Vol. 26 Issue 6, p513, 12p

Schlagwörter: RANDOM number generators, INFORMATION theory, MATHEMATICAL statistics, STORAGE batteries, FRACTAL dimensions, DATA compression, POWER plants

Unconditionally Secure Ciphers with a Short Key for a Source with Unknown Statistics.

Autoren: Ryabko, Boris

Quelle: Entropy; Oct2023, Vol. 25 Issue 10, p1406, 7p

Schlagwörter: DISTRIBUTION (Probability theory), CIPHERS, STATISTICS, DATA compression

Firma/Körperschaft: EUROPEAN Union

Recurrence times, waiting times and universal entropy production estimators.

Autoren: Cristadoro, Giampaolo Degli Esposti, Mirko Jakšić, Vojkan et al.

Quelle: Letters in Mathematical Physics; Feb2023, Vol. 113 Issue 1, p1-26, 26p

Smart Multimedia Compressor—Intelligent Algorithms for Text and Image Compression.

Autoren: Oswald, C Sivaselvan, B

Quelle: Computer Journal; Feb2023, Vol. 66 Issue 2, p463-478, 16p

Schlagwörter: IMAGE compression, DATA compression, ALGORITHMS, DATA mining, GRAPHICAL user interfaces, COMPRESSORS

A High-Level Representation of the Navigation Behavior of Website Visitors.

Autoren: Huidobro, Alicia Monroy, Raúl Cervantes, Bárbara

Quelle: Applied Sciences (2076-3417); Jul2022, Vol. 12 Issue 13, pN.PAG-N.PAG, 22p

Schlagwörter: TASK analysis, NAVIGATION, BLOGS, WEB analytics

Research outlook and state-of-the-art methods in context awareness data modeling and retrieval.

Autoren: Gollagi, S. G. Math, M. M. Kulkarni, U. P.

Quelle: Evolutionary Intelligence; Jun2022, Vol. 15 Issue 2, p1025-1036, 12p

Integration of Single-Port Memory (ISPM) for Multiprecision Computation in Systolic-Array-Based Accelerators.

Autoren: Yang, Renyu Shen, Junzhong Wen, Mei et al.

Quelle: Electronics (2079-9292); May2022, Vol. 11 Issue 10, pN.PAG-N.PAG, 18p

Schlagwörter: DEEP learning, MEMORY, MACHINE learning

The measurement, evolution, and neural representation of action grammars of human behavior.

Autoren: Stout, Dietrich Chaminade, Thierry Apel, Jan et al.

Quelle: Scientific Reports; 7/2/2021, Vol. 11 Issue 1, p1-13, 13p

Schlagwörter: HUMAN behavior, COGNITION, FUNCTIONAL magnetic resonance imaging, DATA analysis, LANGUAGE & languages

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets.

Autoren: Casel, Katrin Fernau, Henning Gaspers, Serge et al.

Quelle: Theory of Computing Systems; 2021, Vol. 65 Issue 2, p344-409, 66p

Schlagwörter: GRAMMAR, NP-complete problems, NP-hard problems, ALPHABET, POLYNOMIAL time algorithms, DYNAMIC programming