Evolving Alphabet using Genetic Algorithms

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86081148" target="_blank" >RIV/61989100:27240/11:86081148 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/NaBIC.2011.6089652" target="_blank" >http://dx.doi.org/10.1109/NaBIC.2011.6089652</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/NaBIC.2011.6089652" target="_blank" >10.1109/NaBIC.2011.6089652</a>

Result language
angličtina
Original language name
Evolving Alphabet using Genetic Algorithms
Original language description
Data compression algorithms were usually designed for data processing symbol by symbol. Symbols are usually characters or bytes, but several other techniques may be used. The most well-known approach is using syllables or words as symbols. Another approach is to take 2-grams, 3-grams or any n-grams as a symbols. All these approaches has pros and cons, but none of them is the best for any file. This paper describes approach of evolving alphabet from characters and 2-grams, which is optimal for compressedtext files. The efficiency of the approach will be tested on three compression algorithms.
Czech name
—
Czech description
—

Project
<a href="/en/project/GPP202%2F11%2FP142" target="_blank" >GPP202/11/P142: Optimization and parallelization of compression methods</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 2011 Third World Congress on Nature and Biologically Inspired Computing
ISBN
978-1-4577-1122-0
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
575-581
Publisher name
IEEE
Place of publication
New York
Event location
Salamanca
Event date
Oct 19, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)