4324 search results - page 3 / 865 » A Generalized Representer Theorem |
125
click to vote
EJC
2006
15 years 1 months ago
2006
For a fixed polyomial f Z[X], let k(N) denote the maximum size of a set A {1, 2, . . . , N} such that no product of k distinct elements of A is in the value set of f. In this pap...
117
click to vote
EJC
2006
15 years 1 months ago
2006
Abstract. We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colo...
115
Voted
DLT
2009
14 years 11 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
115
Voted
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We propose a very general syntactical notion of epistemic state and a compact axiomatization for iterated revision when the new information is an epistemic state. We set ...
129
click to vote
ICML
1989
IEEE
15 years 5 months ago
1989
IEEE
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...