2516 search results - page 25 / 504 » When is there a representer theorem |
160
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
155
Voted
BIOADIT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
155
click to vote
IGPL
1998
15 years 5 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
158
click to vote
JCT
1998
15 years 5 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
164
click to vote
FSS
2011
14 years 9 months ago
2011
In many practical applications, it is useful to represent a function f(x) by its fuzzy transform, i.e., by the “average” values Fi = f(x) · Ai(x) dx Ai(x) dx over different ...