373 search results - page 53 / 75 » On Markov Chains for Independent Sets |
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
The ambiguity inherent in a localized analysis of events from video can be resolved by exploiting constraints between events and examining only feasible global explanations. We sho...
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
ICDCS
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
QEST
2006
IEEE
14 years 1 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...
ISTCS
1993
Springer
13 years 11 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...