|
|
|
|
|
Danny Hucke and Carl Philipp Reh
A grammar-based compressor is an algorithm that receives a word and outputs a context-free grammar that only produces this word. The approximation ratio for a single input word is the size of the grammar produced for this word divided by the size of a sm...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai and Keisuke Goto
Re-Pairis a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it hard to compute Re-Pair on large-scale data sets. As a solution for this pr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dmitry Kosolobov and Daniel Valenzuela
The Lempel-Ziv parsing (LZ77) is a widely popular construction lying at the heart of many compression algorithms. These algorithms usually treat the data as a sequence of bytes, i.e., blocks of fixed length 8. Another common option is to view the data as...
ver más
|
|
|
|
|
|
|
|
|
|
|
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Takuya Kida
This study presents an analysis of RePair, which is a grammar compression algorithm known for its simple scheme, while also being practically effective. First, we show that the main process of RePair, that is, the step by step substitution of the most fr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Collins N Udanor,Chinedu Innocent Nwoye
Pág. pp. 4 - 12
Mobile phone no doubt has become everyone?s personal companion. It finds close companionship among the youths. Mobile phone SMS slang has adversely affected students? ability to write proper English grammar, as they find it a very convenient and economic...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yang, E.-H. He, D.-K.
Pág. 2874 - 2894
|
|
|
|
|
|
|
|
|
|
|
Yang, E-h; Kaltchenko, A; Kieffer, J C
Pág. 2130 - 2150
|
|
|
|
|
|
|
|
|
|
|
Yang, E-h; Kieffer, J C
Pág. 755 - 777
|
|
|
|
|
|