Suffix array is a data structure used for string operations such as pattern matching. It is also useful for some lossless data compression algorithms. In this paper I present a comparison of several di erent ways to construct ...

This diploma thesis deals with the design and implementation of a highly efficient universal index of textual documents. Universal stands for an opportunity to configure structures of index records and methods of the index ...

In standard binary trees the rebalancing is carried out in connection with and immediately folowing the updates. Relaxed balancing allows to separate updates and rebalancing. First advantage of this approach is to keep the ...

For performance evaluation of software systems, benchmarking is used. Benchmarking generates a large amount of output data, which is necessary to store, process and evaluate it. Network Repository serves as a repository ...

The aim of the thesis is to get acquainted with methods for degradation removal (deconvolution) in scalar images in the case when no apriori information about the shape of convolution masks is known (blind deconvolution) ...

This work describes what is known about music theory and it suggests an algorithm for dynamic just-intonation tuning. Software Prelad (Retune) is an integral part of this work. This software contains the following functions: ...

dmoz.org is the largest human-edited directory of the Web. It is possible to get database of this directory by the public from the project web page. The main purpose of my work is to design and implement fulltext search ...

The goal of this project is to implement a system for management of tax advisor's clients. The purpose of this system is to manage all relevant data about clients and work assignments and to simplify time management. An ...