Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Abstract. In this work we present two algorithms of irregular scatter/gather operations based on the binomial tree and Tr¨aff algorithms. We use the prediction provided by hetero...
Kiril Dichev, Vladimir Rychkov, Alexey L. Lastovet...
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
— Reinforcement learning (RL) algorithms have long been promising methods for enabling an autonomous robot to improve its behavior on sequential decision-making tasks. The obviou...