The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Motion estimation algorithms play a key role in picture-rate up-conversion. To realise high quality interpolated images, while keeping the processing requirements low, we analyse ...
Aleksandar Beric, Gerard de Haan, Jef L. van Meerb...
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Abstract. Stereo and motion analysis are potential techniques for providing information for control or assistance systems in various robotics or driver assistance applications. Thi...
Sandino Morales, Young Woon Woo, Reinhard Klette, ...
Abstract. In this paper we present a probabilistic algorithm which factorizes non-negative data. We employ entropic priors to additionally satisfy that user specified pairs of fac...
Paris Smaragdis, Madhusudana V. S. Shashanka, Bhik...