206 search results - page 15 / 42 » Probabilistic Analysis of Large Finite State Machines |
127
click to vote
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
77
Voted
STACS
2005
Springer
15 years 5 months ago
2005
Springer
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
QEST
2006
IEEE
15 years 5 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
APL
1992
ACM
15 years 3 months ago
1992
ACM
We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a P...
ICML
2007
IEEE
16 years 15 days ago
2007
IEEE
We introduce a mixture of probabilistic canonical correlation analyzers model for analyzing local correlations, or more generally mutual statistical dependencies, in cooccurring d...