213 search results - page 3 / 43 » Counting Independent Sets Using the Bethe Approximation |
150
Voted
JCT
2007
15 years 5 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
207
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
120
Voted
RANDOM
1998
Springer
15 years 10 months ago
1998
Springer
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
158
Voted
HYBRID
2007
Springer
15 years 12 months ago
2007
Springer
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
153
click to vote
AAAI
1997
15 years 7 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...