213 search results - page 1 / 43 » Counting Independent Sets Using the Bethe Approximation |
SIAMDM
2011
12 years 11 months ago
2011
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
COLOGNETWENTE
2007
13 years 10 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
SWAT
1994
Springer
14 years 18 days ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
EMNLP
2011
12 years 8 months ago
2011
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...