We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
Multi-label learning refers to the problems where an instance can be assigned to more than one category. In this paper, we present a novel Semi-supervised algorithm for Multi-labe...
Gang Chen, Yangqiu Song, Fei Wang, Changshui Zhang
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
Ben Glocker, Nikos Komodakis, Nassir Navab, Georgi...