2005 search results - page 27 / 401 » Decisive Markov Chains |
BMVC
2001
15 years 3 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
118
click to vote
IJNSEC
2007
15 years 1 months ago
2007
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
111
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The Shannon-McMillan-Breiman theorem asserts that the sample entropy of a stationary and ergodic stochastic process converges to the entropy rate of the same process almost surely...
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
This paper describes a model for generating time series which exhibit the statistical phenomenon known as long-range dependence (LRD). A Markov Modulated Process based upon an inf...