12 search results - page 2 / 3 » Threshold values of random K-SAT from the cavity method |
BMCBI
2008
13 years 7 months ago
2008
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
ALGORITHMICA
2007
13 years 7 months ago
2007
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
ISBRA
2009
Springer
14 years 2 months ago
2009
Springer
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...