881 search results - page 156 / 177 » A Model of Tolerance |
PODC
2010
ACM
14 years 1 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
ALT
2006
Springer
14 years 6 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
SOSP
2003
ACM
14 years 6 months ago
2003
ACM
This paper presents a new approach called model-carrying code (MCC) for safe execution of untrusted code. At the heart of MCC is the idea that untrusted code comes equipped with a...
SAC
2010
ACM
14 years 4 months ago
2010
ACM
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...