Výsledky vyhledávání - "universal data compression algorithm"

  1. 1

    Measuring the Efficiency of the Intraday Forex Market with a Universal Data Compression Algorithm Autor Shmilovici, Armin, Kahiri, Yoav, Ben-Gal, Irad, Hauser, Shmuel

    ISSN: 0927-7099, 1572-9974
    Vydáno: Boston Springer US 01.03.2009
    Vydá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. 2

    The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length N-Blocks Autor Ziv, J.

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York, NY IEEE 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. 3

    A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm Autor Krishnan, Nikhil, Baron, Dror

    ISSN: 1932-4553, 1941-0484
    Vydáno: IEEE 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. 4

    On Finite Memory Universal Data Compression and Classification of Individual Sequences Autor Ziv, J.

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York, NY IEEE 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. 5

    Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder Autor Yang, En-Hui, He, Da-Ke

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York, NY IEEE 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. 6

    Branch prediction based on universal data compression algorithms Autor Federovsky, E., Feder, M., Weiss, S.

    ISBN: 9780818684913, 0818684917
    ISSN: 1063-6897
    Vydáno: IEEE 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. 7

    Branch prediction based on universal data compression algorithms Autor Federovsky, Eitan, Feder, Meir, Weiss, Sholomo

    ISBN: 9780818684913, 0818684917
    Vydáno: Washington, DC, USA IEEE Computer Society 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. 8

    Universal data compression algorithms by using normal tree models Autor Chang, S.-Y.

    ISBN: 9780780314450, 078031445X
    Vydáno: IEEE 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. 9

    Comparison between universal data-compression algorithms applied to Markov sources Autor Amir, I., Plotnik, E., Weinberger, M.J., Tal, N.

    ISBN: 9780879426781, 0879426780
    Vydáno: IEEE 1991
    “…A comparison between universal data compression algorithms applied to binary Markov sources is presented…”
    Získat plný text
    Konferenční příspěvek
  10. 10

    Universal data compression algorithms by using full tree models Autor Chang, S.-Y., Metzner, J.J.

    ISBN: 0818692022, 9780818692024
    Vydáno: IEEE Comput. Soc. Press 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. 11

    A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm Autor Krishnan, Nikhil, Baron, Dror

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 21.03.2015
    Vydá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. 12

    Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm Autor Plotnik, E., Weinberger, M.J., Ziv, J.

    ISSN: 0018-9448
    Vydáno: New York, NY IEEE 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. 13

    A grammar-based compression using a variation of Chomsky normal form of context free grammar Autor Arimura, Mitsuharu

    Vydáno: IEICE 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. 14

    Performance of parallel two-pass MDL context tree algorithm Autor Krishnan, Nikhil, Baron, Dror

    Vydáno: IEEE 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. 15

    A universal data compression system Autor Rissanen, J.

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York, NY IEEE 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. 16

    A constrained-dictionary version of LZ78 asymptotically achieves the finite-state compressibility with a distortion measure Autor Ziv, Jacob

    ISBN: 1479955248, 9781479955244
    Vydáno: IEEE 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. 17

    Universal data compression and repetition times Autor Willems, F.M.J.

    ISSN: 0018-9448
    Vydáno: New York, NY IEEE 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. 18

    On Finite Memory Universal Data Compression and Classification of Individual Sequences Autor Ziv, Jacob

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 24.01.2013
    Vydá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. 19

    A Constrained-Dictionary version of LZ78 asymptotically achieves the Finite-State Compressibility for any Individual Sequence with a Distortion measure Autor Ziv, Jacob

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 13.03.2015
    Vydá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. 20

    Modelling the EAH Data Compression Algorithm using Graph Theory Autor Trinca, Dragos

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 21.08.2005
    Vydá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