721 search results - page 107 / 145 » Bounds on the k-domination number of a graph |
COMBINATORICA
2004
14 years 11 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...
DAC
2006
ACM
16 years 23 days ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
108
click to vote
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
TIT
2008
14 years 11 months ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
COMBINATORICA
2008
14 years 12 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...