1120 search results - page 29 / 224 » Eager Markov Chains |
104
click to vote
ATVA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
ICPR
2006
IEEE
16 years 27 days ago
2006
IEEE
We investigate the use of recently proposed character and word sequence kernels for the task of authorship attribution and compare their performance with two probabilistic approac...
CONCUR
2009
Springer
15 years 6 months ago
2009
Springer
We propose how to present and compute a counterexample in probabilistic LTL model checking for discrete-time Markov chains. In qualitative probabilistic model checking, we present ...
109
click to vote
RIAO
2007
15 years 1 months ago
2007
Document expansion and query expansion aim to add related terms into document and query representations in order to make them more complete. However, most previous studies are lim...
105
click to vote
AAAI
2004
15 years 1 months ago
2004
Based on the probabilistic reformulation of principal component analysis (PCA), we consider the problem of determining the number of principal components as a model selection prob...