Sciweavers

1120 search results - page 96 / 224
» Eager Markov Chains
Sort
View
FORMATS
2006
Springer
15 years 10 months ago
Extended Directed Search for Probabilistic Timed Reachability
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
Husain Aljazzar, Stefan Leue
ENTCS
2006
119views more  ENTCS 2006»
15 years 6 months ago
Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity
The notion of equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. The reason is that, besid...
Marco Bernardo
PAMI
2008
137views more  PAMI 2008»
15 years 6 months ago
Tracking the Visual Focus of Attention for a Varying Number of Wandering People
In this article, we define and address the problem of finding the visual focus of attention for a varying number of wandering people (VFOA-W)
Kevin Smith, Sileye O. Ba, Jean-Marc Odobez, Danie...
JCT
2000
78views more  JCT 2000»
15 years 6 months ago
Discrete Green's Functions
We study discrete Green's functions and their relationship with discrete Laplace equations. Several methods for deriving Green's functions are discussed. Green's fu...
Fan R. K. Chung, S.-T. Yau
ML
2002
ACM
246views Machine Learning» more  ML 2002»
15 years 6 months ago
Bayesian Clustering by Dynamics
This paper introduces a Bayesian method for clustering dynamic processes. The method models dynamics as Markov chains and then applies an agglomerative clustering procedure to disc...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen