Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Optimizing mpf queries: decision support and probabilistic inference
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Online Filtering, Smoothing and Probabilistic Modeling of Streaming data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Exploiting causal independence in Bayesian network inference
Journal of Artificial Intelligence Research
A method for implementing a probabilistic model as a relational database
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
The Right Expert at the Right Time and Place
PAKM '08 Proceedings of the 7th International Conference on Practical Aspects of Knowledge Management
Hi-index | 0.00 |
When dealing with sensors with different time resolutions, it is desirable to model a sensor reading as pertaining to a time interval rather than a unit of time. We introduce two variants on the Hidden Markov Model in which this is possible: a reading extends over an arbitrary number of hidden states. We derive inference algorithms for the models, and analyse their efficiency. For this, we introduce a new method: we start with an inefficient algorithm directly derived from the model, and visually optimize it using a sum-factor diagram.