Zobrazeno 1 - 10
of 264
pro vyhledávání: '"GREEDY PARSING"'
Autor:
Legrand, Joël, Collobert, Ronan
This paper introduces a greedy parser based on neural networks, which leverages a new compositional sub-tree representation. The greedy parser and the compositional procedure are jointly trained, and tightly depends on each-other. The composition pro
Externí odkaz:
http://arxiv.org/abs/1412.7028
Dynamic dictionary-based compression schemes are the most daily used data compression schemes since they appeared in the foundational papers of Ziv and Lempel in 1977, commonly referred to as LZ77. Their work is the base of Deflate, gZip, WinZip, 7Zi
Externí odkaz:
http://arxiv.org/abs/1211.5350
Publikováno v:
In Theoretical Computer Science 13 March 2014 525:55-59
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Legrand, Jo��l, Collobert, Ronan
This paper introduces a greedy parser based on neural networks, which leverages a new compositional sub-tree representation. The greedy parser and the compositional procedure are jointly trained, and tightly depends on each-other. The composition pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f174a0b9efe26a3f2fc4e63c70bb802
Autor:
Tim Bell, Ian H. Witten
Publikováno v:
Journal of the ACM. 41:708-724
Text compression methods can be divided into two classes: symbolwise and parsing . Symbolwise methods assign codes to individual symbols, while parsing methods assign codes to groups of consecutive symbols (phrases). The set of phrases available to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::716303c340c3e4e26e538f2d765988b6
https://doi.org/10.1145/179812.179892
https://doi.org/10.1145/179812.179892
Autor:
Bell, T C1 (AUTHOR), Witten, I H (AUTHOR)
Publikováno v:
Journal of the Association for Computing Machinery. Jul1994, Vol. 41 Issue 4, p708-724. 17p.
Autor:
R.N. Horspool
Publikováno v:
Data Compression Conference
Most practical compression methods in the LZ77 and LZ78 families parse their input using a greedy heuristic. However the popular gzip compression program demonstrates that modest but significant gains in compression performance are possible if non-gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74ba65ee4a08d966bd29d50349015cd8
https://doi.org/10.1109/dcc.1995.515520
https://doi.org/10.1109/dcc.1995.515520
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Zhen Yao
Publikováno v:
DCC
Summary form only given. LZ dictionary coders parse the message into successive substrings, each consists two parts, the citation, the longest prefix phrase that has already been accommodated in the dictionary, and the innovation, the symbol immediat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc272a82b5a50f172d4725b09cfa980c
https://doi.org/10.1109/dcc.2003.1194075
https://doi.org/10.1109/dcc.2003.1194075