Sciweavers

5592 search results - page 136 / 1119
» On Random Betweenness Constraints
Sort
View
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 4 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
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...
Hagit Attiya, Keren Censor-Hillel
CL
2000
Springer
14 years 2 months ago
Better Communication for Tighter Cooperation
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...
Petra Hofstedt
ICPR
2004
IEEE
14 years 11 months ago
A Hybrid Face Recognition Method using Markov Random Fields
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 ...
Dimitris N. Metaxas, Rui Huang, Vladimir Pavlovic
IWSEC
2007
Springer
14 years 4 months ago
Run-Time Randomization to Mitigate Tampering
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...
SRDS
2006
IEEE
14 years 4 months ago
Experimental Comparison of Local and Shared Coin Randomized Consensus Protocols
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...