528 search results - page 31 / 106 » Causal inference using the algorithmic Markov condition |
201
click to vote
JMLR
2012
13 years 8 days ago
2012
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
191
click to vote
AAECC
2011
Springer
14 years 4 months ago
2011
Springer
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
AAAI
2006
14 years 11 months ago
2006
Reasoning with both probabilistic and deterministic dependencies is important for many real-world problems, and in particular for the emerging field of statistical relational lear...
106
click to vote
PE
2002
Springer
14 years 9 months ago
2002
Springer
In this paper, we study the use of continuous-time hidden Markov models (CT-HMMs) for network protocol and application performance evaluation. We develop an algorithm to infer the...
OOPSLA
1991
Springer
15 years 1 months ago
1991
Springer
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...