Sciweavers

388 search results - page 58 / 78
» On the Number of Cycles in Planar Graphs
Sort
View
RSA
2006
66views more  RSA 2006»
14 years 11 months ago
Regular graphs whose subgraphs tend to be acyclic
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
Noga Alon, Eitan Bachmat
98
Voted
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 9 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 12 months ago
Graph Zeta Function in the Bethe Free Energy and Loopy Belief Propagation
We propose a new approach to the analysis of Loopy Belief Propagation (LBP) by establishing a formula that connects the Hessian of the Bethe free energy with the edge zeta functio...
Yusuke Watanabe, Kenji Fukumizu
TIT
2008
127views more  TIT 2008»
14 years 11 months ago
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
Mohsen Bayati, Devavrat Shah, Mayank Sharma
CSL
2007
Springer
15 years 6 months ago
The Power of Counting Logics on Restricted Classes of Finite Structures
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
Anuj Dawar, David Richerby