142 search results - page 12 / 29 » On the Independent Domination Number of Random Regular Graph... |
257
click to vote
PAMI
2010
14 years 10 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
102
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
ENDM
2006
14 years 11 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
115
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...