Reducing alphabet using genetic algorithms

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Reducing alphabet using genetic algorithms

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Reducing alphabet using genetic algorithms

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GPP202%2F11%2FP142" target="_blank" >GPP202/11/P142: Optimalizace a paralelizace kompresních metod</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2011

Kód důvěrnosti údajů

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

Název periodika

Communications in Computer and Information Science

ISSN

1865-0929

e-ISSN

—

Svazek periodika

189

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

11

Strana od-do

82-92

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—