13 search results - page 3 / 3 » Rademacher and Gaussian Complexities: Risk Bounds and Struct... |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract— Infrastructure based wireless communications systems as well as ad hoc networks experience a growing importance in present-day telecommunications. An increased density ...
JCSS
2008
13 years 5 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...