We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining on...
In this paper, we present a novel, threshold-free robust estimation framework capable of efficiently fitting models to contaminated data. While RANSAC and its many variants have...
We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no...
Fatemeh Borran, Martin Hutle, Nuno Santos, Andr&ea...
Background: With continuing identification of novel structured noncoding RNAs, there is an increasing need to create schematic diagrams showing the consensus features of these mol...
We present a novel variant of the RANSAC algorithm
that is much more efficient, in particular when dealing with
problems with low inlier ratios. Our algorithm assumes
that there...