2944 search results - page 280 / 589 » Improving Bound Propagation |
174
Voted
ECCC
2010
15 years 6 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
187
click to vote
EJC
2006
15 years 6 months ago
2006
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
135
click to vote
DAM
2007
15 years 6 months ago
2007
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
164
click to vote
EJC
2007
15 years 6 months ago
2007
Balanced incomplete-block designs (BIBDs) with repeated blocks are studied and constructed. We continue work initiated by van Lint and Ryser in 1972 and pursued by van Lint in 197...
170
click to vote
JMLR
2006
15 years 6 months ago
2006
We present worst case bounds for the learning rate of a known prediction method that is based on hierarchical applications of binary context tree weighting (CTW) predictors. A heu...