52 search results - page 3 / 11 » A comparison of tight generalization error bounds |
VTC
2006
IEEE
13 years 11 months ago
2006
IEEE
— This paper examines the bit error probability (BEP) of bit-interleaved coded modulation and iterative decoding (BICM-ID) in OFDM systems with modulation diversity (MD) over cor...
GLOBECOM
2008
IEEE
14 years 7 days ago
2008
IEEE
—We propose a non-coherent receiver for the fixed detect-and-forward relay channel and derive a closed-form tight upper bound on its bit error probability in Rayleigh fading cha...
JMLR
2008
13 years 5 months ago
2008
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
IWANN
2001
Springer
13 years 10 months ago
2001
Springer
One of the main research concern in neural networks is to find the appropriate network size in order to minimize the trade-off between overfitting and poor approximation. In this ...
ML
2010
ACM
13 years 17 days ago
2010
ACM
We introduce a general-purpose learning machine that we call the Guaranteed Error Machine, or GEM, and two learning algorithms, a real GEM algorithm and an ideal GEM algorithm. Th...