2095 search results - page 168 / 419 » Improved pebbling bounds |
169
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...
161
click to vote
JCT
2007
15 years 6 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
180
click to vote
JSAC
1998
15 years 6 months ago
1998
—The performance and design of turbo codes using coherent BPSK signaling on the Rayleigh fading channel is considered. In low signal-to-noise regions, performance analysis uses s...
186
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
149
click to vote
IPL
2010
15 years 5 months ago
2010
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...