INFORMATICALT
2008
13 years 3 months ago
2008
Classification and regression tree approach was used in this research to model phone duration of Lithuanian. 300 thousand samples of vowels and 400 thousand samples of consonants e...
INFORMATICALT
2006
13 years 4 months ago
2006
New ways to estimate ranges of values of functions from standard and inner interval arithmetic have been proposed. Using the proposed ways ranges of values of mathematical test fun...
INFORMATICALT
2006
13 years 4 months ago
2006
The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the secon...
INFORMATICALT
2006
13 years 4 months ago
2006
In this paper we consider two logics: temporal logic of common knowledge and temporal logic of common belief. These logics involve the discrete time linear temporal logic operators...
INFORMATICALT
2006
13 years 4 months ago
2006
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
INFORMATICALT
2006
13 years 4 months ago
2006
In this paper, a digital watermarking algorithm for copyright protection based on the concept of embed digital watermark and modifying frequency coefficients in discrete wavelet tr...
INFORMATICALT
2006
13 years 4 months ago
2006
The paper proposes a methodology for evaluation of specification language functionality characteristics. It describes background of the proposed methodology, discusses the methodol...
INFORMATICALT
2006
13 years 4 months ago
2006
Matrix transpose in parallel systems typically involves costly all-to-all communications. In this paper, we provide a comparative characterization of various efficient algorithms f...
INFORMATICALT
2006
13 years 4 months ago
2006
Abstract. The aim of the given paper is the development of an approach for parametric identification of Hammerstein systems with piecewise linear nonlinearities, i.e., when the sat...
INFORMATICALT
2006
13 years 4 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...