854 search results - page 18 / 171 » Abstracting from Failure Probabilities |
121
click to vote
DC
1999
14 years 11 months ago
1999
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
102
click to vote
ISSRE
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract—As smart phones grow in popularity, manufacturers are in a race to pack an increasingly rich set of features into these tiny devices. This brings additional complexity i...
TASLP
2008
14 years 11 months ago
2008
Abstract--In this contribution we present an improved estimator for the speech presence probability at each time-frequency point in the short-time Fourier-transform domain. In cont...
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...