All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Optimizing alphabet using genetic algorithms

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86081152" target="_blank" >RIV/61989100:27240/11:86081152 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/ISDA.2011.6121705" target="_blank" >http://dx.doi.org/10.1109/ISDA.2011.6121705</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ISDA.2011.6121705" target="_blank" >10.1109/ISDA.2011.6121705</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Optimizing alphabet using genetic algorithms

  • Original language description

    Data compression algorithms were usually designed for data processing symbol by symbol. The input symbols of these algorithms are usually taken from the ASCII table, i.e. the size of the input alphabet is 256 symbols which are representable by 8-bit numbers. Several other techniques were developed-syllable-based compression, which uses the syllable as a basic compression symbol, and word-based compression, which uses words as basic symbols. These three approaches are strictly bounded and no overlap is allowed. This may be a problem because it may be helpful to have an overlap between them and use a character-based approach with a few symbols as a sequence of characters. This paper describes an algorithm that looks for the optimal alphabet for differenttext files. The alphabet may contain characters and 2-grams.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

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

Others

  • Publication year

    2011

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    11th International Conference on Intelligent Systems Design and Applications ISDA 2011 : proceedings

  • ISBN

    978-1-4577-1676-8

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    498-503

  • Publisher name

    IEEE

  • Place of publication

    London

  • Event location

    Cordoba

  • Event date

    Nov 22, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article