554 search results - page 66 / 111 » Approximate Probabilistic Model Checking |
CAV
2009
Springer
14 years 8 months ago
2009
Springer
We address the problem of analyzing programs such as J2ME midlets for mobile devices, where a central correctness requirement concerns confidentiality of data that the user wants t...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...
QEST
2006
IEEE
14 years 1 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
COLING
2010
13 years 2 months ago
2010
In the field of multi-document summarization, the Pyramid method has become an important approach for evaluating machine-generated summaries. The method is based on the manual ann...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...