Concentration for self-bounding functions and an inequality of Talagrand
Random Structures & Algorithms
Efficient blocking probability computation of complex traffic flows for network dimensioning
Computers and Operations Research
On the doubt about margin explanation of boosting
Artificial Intelligence
| Hi-index | 0.00 |
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities give improved concentration results for optimal traveling salesmen tours, Steiner trees, and the eigenvalues of random symmetric matrices. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006