928 search results - page 69 / 186 » The Convergence Rate of AdaBoost |
DCC
2010
IEEE
14 years 4 months ago
2010
IEEE
Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on...
COLT
2005
Springer
14 years 3 months ago
2005
Springer
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...
ICDCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
GECCO
2000
Springer
14 years 1 months ago
2000
Springer
In earlier work we predicted program size would grow in the limit at a quadratic rate and up to fty generations we measured bloat O(generations1:2;1:5). On two simple benchmarks w...
DAGSTUHL
2004
13 years 11 months ago
2004
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...