Sciweavers

854 search results - page 11 / 171
» Abstracting from Failure Probabilities
Sort
View
TNN
2008
142views more  TNN 2008»
14 years 11 months ago
Multiclass Posterior Probability Support Vector Machines
Abstract--Tao et al. have recently proposed the posterior probability support vector machine (PPSVM) which uses soft labels derived from estimated posterior probabilities to be mor...
Mehmet Gönen, Ayse Gönül Tanugur, E...
ENTCS
2006
119views more  ENTCS 2006»
14 years 11 months ago
Trace Machines for Observing Continuous-Time Markov Chains
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
Verena Wolf, Christel Baier, Mila E. Majster-Ceder...
OSDI
2000
ACM
15 years 1 months ago
Exploring Failure Transparency and the Limits of Generic Recovery
: We explore the abstraction of failure transparency in which the operating system provides the illusion of failure-free operation. To provide failure transparency, an operating sy...
David E. Lowell, Subhachandra Chandra, Peter M. Ch...
NCA
2009
IEEE
15 years 6 months ago
Maintaining Network QoS Across NIC Device Driver Failures Using Virtualization
: © Maintaining Network QoS Across NIC Device Driver Failures Using Virtualization Michael Le, Andrew Gallagher, Yuval Tamir, Yoshio Turner HP Laboratories HPL-2009-115 device dri...
Michael Le, Andrew Gallagher, Yuval Tamir, Yoshio ...
SIGCOMM
2005
ACM
15 years 5 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...