83 search results - page 12 / 17 » Rademacher Chaos Complexities for Learning the Kernel Proble... |
MICAI
2004
Springer
14 years 1 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
JMLR
2008
13 years 7 months ago
2008
This paper investigates statistical performances of Support Vector Machines (SVM) and considers the problem of adaptation to the margin parameter and to complexity. In particular ...
ICANNGA
2009
Springer
14 years 2 months ago
2009
Springer
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
PAMI
2010
13 years 6 months ago
2010
—This paper proposes a framework for single-image super-resolution. The underlying idea is to learn a map from input low-resolution images to target high-resolution images based ...