543 search results - page 15 / 109 » New Upper Bounds for MaxSat |
103
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
COMBINATORICA
2004
14 years 9 months ago
2004
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
ACL
2012
13 years 1 days ago
2012
Many researchers have attempted to predict the Enron corporate hierarchy from the data. This work, however, has been hampered by a lack of data. We present a new, large, and freel...
JCT
2007
14 years 9 months ago
2007
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
107
click to vote
AAAI
2010
14 years 11 months ago
2010
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...