Reducing alphabet using genetic algorithms

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

Result language
angličtina
Original language name
Reducing alphabet using genetic algorithms
Original language description
In the past, several approaches for data compression were developed. The base approach use characters as basic compression unit, but syllable-based and word based approaches were also developed. These approaches define strict borders between basic units.These borders are valid only for tested collections. Moreover, there may be words, which are not syllables, but it is useful to use them even in syllable based approach or in character based approach. Of course, testing of all possibilities is not realizable in finite time. Therefor, a optimization technique may be used as possible solution. This paper describes first steps in the way to optimal compression alphabet - designing the basic algorithms for alphabet reduction using genetic algorithms.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

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ů

Similar results(10)