854 search results - page 54 / 171 » Abstracting from Failure Probabilities |
177
click to vote
CSL
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
130
click to vote
MICCAI
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Probabilistic tractography provides estimates of the probability of a structural connection between points or regions in a brain volume, based on information from diffusi...
136
click to vote
DSN
2009
IEEE
16 years 23 days ago
2009
IEEE
We consider a set of clients collaborating through an online service provider that is subject to attacks, and hence y trusted by the clients. We introduce the abstraction of a fai...
205
click to vote
CCECE
2006
IEEE
16 years 2 days ago
2006
IEEE
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
237
click to vote
ACCV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...