854 search results - page 14 / 171 » Abstracting from Failure Probabilities |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
JCSS
2007
14 years 11 months ago
2007
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
104
click to vote
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper, we show that the optimization of density forecasting models for regression in machine learning can be formulated as a multi-objective problem. We describe ...
112
click to vote
SOSP
2001
ACM
15 years 8 months ago
2001
ACM
ing Abstraction to Improve Fault Tolerance MIGUEL CASTRO Microsoft Research and RODRIGO RODRIGUES and BARBARA LISKOV MIT Laboratory for Computer Science Software errors are a major...
WDAG
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...