In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
We developed Relational Data Mining approach which allows to overcome essential limitations of the Data Mining and Knowledge Discovery techniques. In the paper the approach was im...
I. V. Khomicheva, Eugenii E. Vityaev, Elena A. Ana...
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
In this paper we present a two-level generative model for representing the images and surface depth maps of drapery and clothes. The upper level consists of a number of folds whic...