This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
We propose a general scheme for the cooperation of different constraint solvers. A uniform interface for constraint solvers allows to formally specify information exchange between...
We propose a hybrid face recognition method that combines holistic and feature analysis-based approaches using a Markov random field (MRF) model. The face images are divided into ...
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
Bertrand Anckaert, Mariusz H. Jakubowski, Ramarath...
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication com...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...