Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...
In this paper, we present an algorithm for estimating disparity for images containing large textureless regions. We propose a fast and efficient region growing algorithm for estima...
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Particle systems have been incorporated into a wide variety of applications in both academia and industry. They can be employed to investigate complex natural phenomena, illustrat...
: In this paper, we present the experience gained with the participation in a case study in which a novel high-level design language (UML4SOA) was used to produce a service-oriente...