Sciweavers

143 search results - page 15 / 29
» Randomness versus Fault-Tolerance
Sort
View
SIGCOMM
2006
ACM
15 years 3 months ago
Minimizing churn in distributed systems
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
Brighten Godfrey, Scott Shenker, Ion Stoica
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 7 months ago
Differential Privacy versus Quantitative Information Flow
Differential privacy is a notion of privacy that has become very popular in the database community. Roughly, the idea is that a randomized query mechanism provides sufficient priva...
Mário S. Alvim, Konstantinos Chatzikokolaki...
SAC
2010
ACM
15 years 4 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
RANDOM
1998
Springer
15 years 1 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
PAMI
2011
14 years 14 days ago
Hidden Part Models for Human Action Recognition: Probabilistic versus Max Margin
—We present a discriminative part-based approach for human action recognition from video sequences using motion features. Our model is based on the recently proposed hidden condi...
Yang Wang 0003, Greg Mori