Glynchyk L. Algorithms of archiving are on the basis of scale of notation of Shterna-Broko

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0410U005905

Thesis Registration Form

0410U005905.pdf

Applicant for

Glynchyk Ludmyla Yaroslavivna

Specialization

01.05.03 - Математичне та програмне забезпечення обчислювальних машин і систем

Date of defense

14-10-2010

Specialized Academic Board

Д 26.001.09

Taras Shevchenko National University of Kyiv

Essay

The dissertation is devoted to actual questions of the information compression algorithms development. The actuality creation of such algorithms is shown for the real time information. The information compression general questions are investigated. Modern compression and renewal algorithms are developed and realized for the text information, binary chain and binary image. The Shtern-Broko sсale of notation (tree) is laid on the algorithms foundation.

Thesis supervisor

Provotar Oleksandr Ivanovich

Official opponents

Лавріщева Катерина Михайлівна
Єшов Сергій Володимирович

Files

aref.doc

diss.doc

Similar theses

0421U104038

Petrenko Maksym V.

Methods of integration of heterogeneous bibliographic data

0421U104040

Artabaev Yurii Z.

A technique for increasing the accuracy of integrated navigation systems based on predictive models using genetic algorithms.

0421U103593

Zubko Roman Anatoliyovych

Improving methods to increase the time efficiency of fractal image compression

0421U103401

Chystyakova Inna S.

Mapping method between the description logic and the relational data model.

0421U103320

Bielozorova Yana Andriivna

Method of application of wavelet analysis in problems of identification of speech information