511 search results - page 2 / 103 » Lower bounds for distributed markov chain problems |
EOR
2007
13 years 4 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
ALMOB
2006
13 years 4 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...