Výsledky vyhledávání - "universal data compression algorithm"
-
1
Measuring the Efficiency of the Intraday Forex Market with a Universal Data Compression Algorithm
ISSN: 0927-7099, 1572-9974Vydáno: Boston Springer US 01.03.2009Vydáno v Computational economics (01.03.2009)“…Universal compression algorithms can detect recurring patterns in any type of temporal data—including financial data—for the purpose of compression. The…”
Získat plný text
Journal Article -
2
The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length N-Blocks
ISSN: 0018-9448, 1557-9654Vydáno: New York, NY IEEE 01.05.2009Vydáno v IEEE transactions on information theory (01.05.2009)“… No a priori information about X is available at the encoder, which must therefore adopt a universal data-compression algorithm…”
Získat plný text
Journal Article -
3
A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm
ISSN: 1932-4553, 1941-0484Vydáno: IEEE 01.06.2015Vydáno v IEEE journal of selected topics in signal processing (01.06.2015)“… We present a novel lossless universal data compression algorithm that uses parallel computational units to increase the throughput…”
Získat plný text
Journal Article -
4
On Finite Memory Universal Data Compression and Classification of Individual Sequences
ISSN: 0018-9448, 1557-9654Vydáno: New York, NY IEEE 01.04.2008Vydáno v IEEE transactions on information theory (01.04.2008)“… No a priori information about is available at the encoder, which must therefore adopt a universal data-compression algorithm…”
Získat plný text
Journal Article -
5
Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder
ISSN: 0018-9448, 1557-9654Vydáno: New York, NY IEEE 01.04.2010Vydáno v IEEE transactions on information theory (01.04.2010)“…A source coding paradigm called interactive encoding and decoding (IED) is considered for a source network where a finite alphabet source X is to be encoded,…”
Získat plný text
Journal Article -
6
Branch prediction based on universal data compression algorithms
ISBN: 9780818684913, 0818684917ISSN: 1063-6897Vydáno: IEEE 1998Vydáno v Proceedings. 25th Annual International Symposium on Computer Architecture (Cat. No.98CB36235) (1998)“…Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction…”
Získat plný text
Konferenční příspěvek -
7
Branch prediction based on universal data compression algorithms
ISBN: 9780818684913, 0818684917Vydáno: Washington, DC, USA IEEE Computer Society 16.04.1998Vydáno v Proceedings of the 25th annual international symposium on Computer architecture (16.04.1998)“…Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction…”
Získat plný text
Konferenční příspěvek -
8
Universal data compression algorithms by using normal tree models
ISBN: 9780780314450, 078031445XVydáno: IEEE 1993Vydáno v Communications and Networks for the Year Two Thousand: Proceedings of SICON - ICIE '93 (1993)“…Universal data compression algorithms are the algorithms by which source data can be coded without a priori knowledge of statistics of a source…”
Získat plný text
Konferenční příspěvek -
9
Comparison between universal data-compression algorithms applied to Markov sources
ISBN: 9780879426781, 0879426780“…A comparison between universal data compression algorithms applied to binary Markov sources is presented…”Vydáno: IEEE 1991
Získat plný text
Konferenční příspěvek -
10
Universal data compression algorithms by using full tree models
ISBN: 0818692022, 9780818692024Vydáno: IEEE Comput. Soc. Press 1991Vydáno v Data Compression Conference, (DCC 1991 (1991)“…Summary form only given. A brief description and results of analysis of splitting and merging for constructing and updating full trees is provided. Since all…”
Získat plný text
Konferenční příspěvek -
11
A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 21.03.2015Vydáno v arXiv.org (21.03.2015)“… We present a novel lossless universal data compression algorithm that uses parallel computational units to increase the throughput. The length-\(N…”
Získat plný text
Paper -
12
Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
ISSN: 0018-9448Vydáno: New York, NY IEEE 01.01.1992Vydáno v IEEE transactions on information theory (01.01.1992)“… This bound is used to derive an upper bound on the redundance of the L-Z universal data compression algorithm applied to finite-state sources, that depends on the length N of the sequence…”
Získat plný text
Journal Article Konferenční příspěvek -
13
A grammar-based compression using a variation of Chomsky normal form of context free grammar
Vydáno: IEICE 01.10.2016Vydáno v ISITA 2016 : proceedings of 2016 International Symposium on Information Theory and Its Applications : Hyatt Regency Monterey Hotel, Monterey, California, USA, October 30 - November 2, 2016 (01.10.2016)“…This paper proposes a new class of grammar-based lossless source code. Grammar-based code is a class of universal data compression algorithm using a context-free grammar…”
Získat plný text
Konferenční příspěvek -
14
Performance of parallel two-pass MDL context tree algorithm
Vydáno: IEEE 01.12.2014Vydáno v 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) (01.12.2014)“… We present numerical results that showcase the advantages of a novel lossless universal data compression algorithm that uses parallel computational units to increase the throughput with minimal…”
Získat plný text
Konferenční příspěvek -
15
A universal data compression system
ISSN: 0018-9448, 1557-9654Vydáno: New York, NY IEEE 01.09.1983Vydáno v IEEE transactions on information theory (01.09.1983)“…A universal data compression algorithm is described which is capable of compressing long strings generated by a "finitely generated" source, with a near optimum per symbol length without prior knowledge of the source…”
Získat plný text
Journal Article -
16
A constrained-dictionary version of LZ78 asymptotically achieves the finite-state compressibility with a distortion measure
ISBN: 1479955248, 9781479955244Vydáno: IEEE 01.04.2015Vydáno v 2015 IEEE Information Theory Workshop (ITW) (01.04.2015)“…The unrestricted-dictionary type LZ78 universal data-compression algorithm (as well as the LZ77 and LZW versions…”
Získat plný text
Konferenční příspěvek -
17
Universal data compression and repetition times
ISSN: 0018-9448Vydáno: New York, NY IEEE 01.01.1989Vydáno v IEEE transactions on information theory (01.01.1989)“…A novel universal data compression algorithm is described. This algorithm encodes L source symbols at a time…”
Získat plný text
Journal Article Konferenční příspěvek -
18
On Finite Memory Universal Data Compression and Classification of Individual Sequences
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 24.01.2013Vydáno v arXiv.org (24.01.2013)“… No a-priori information about X is available at the encoder, which must therefore adopt a universal data-compression algorithm…”
Získat plný text
Paper -
19
A Constrained-Dictionary version of LZ78 asymptotically achieves the Finite-State Compressibility for any Individual Sequence with a Distortion measure
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 13.03.2015Vydáno v arXiv.org (13.03.2015)“…The unrestricted LZ78 universal data-compression algorithm (as well as the LZ77 and LZW versions…”
Získat plný text
Paper -
20
Modelling the EAH Data Compression Algorithm using Graph Theory
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 21.08.2005Vydáno v arXiv.org (21.08.2005)“… in [Dragos Trinca, ITCC-2004], where we have behaviorally shown that for a large class of input data strings, these algorithms substantially outperform the Lempel-Ziv universal data compression algorithm…”
Získat plný text
Paper

