1435 search results - page 84 / 287 » Generalization Error Bounds Using Unlabeled Data |
STOC
1998
ACM
15 years 2 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
IACR
2011
13 years 9 months ago
2011
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
NIPS
2008
14 years 11 months ago
2008
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
ASPLOS
2010
ACM
15 years 4 months ago
2010
ACM
Computer systems often fail due to many factors such as software bugs or administrator errors. Diagnosing such production run failures is an important but challenging task since i...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...