Sciweavers

1167 search results - page 112 / 234
» Relational Markov Games
Sort
View
AAAI
2008
15 years 8 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
ENTCS
2006
119views more  ENTCS 2006»
15 years 5 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
JMLR
2010
150views more  JMLR 2010»
15 years 15 days ago
Approximate parameter inference in a stochastic reaction-diffusion model
We present an approximate inference approach to parameter estimation in a spatio-temporal stochastic process of the reaction-diffusion type. The continuous space limit of an infer...
Andreas Ruttor, Manfred Opper
ECAI
2010
Springer
15 years 6 months ago
Discovering an Event Taxonomy from Video using Qualitative Spatio-temporal Graphs
This work proposes a graph mining based approach to mine a taxonomy of events from activities for complex videos which are represented in terms of qualitative spatio-temporal relat...
Muralikrishna Sridhar, Anthony G. Cohn, David C. H...
FPCA
1995
15 years 9 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong