Sciweavers

4324 search results - page 3 / 865
» A Generalized Representer Theorem
Sort
View
EJC
2006
13 years 6 months ago
Product representations of polynomials
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...
Jacques Verstraëte
EJC
2006
13 years 6 months ago
An iterative-bijective approach to generalizations of Schur's theorem
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...
Sylvie Corteel, Jeremy Lovejoy
DLT
2009
13 years 4 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
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...
Aleksi Saarela
ECAI
2000
Springer
13 years 10 months ago
Iterated Revision by Epistemic States: Axioms, Semantics and Syntax
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 ...
Salem Benferhat, Sébastien Konieczny, Odile...
ICML
1989
IEEE
13 years 10 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
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...
Scott Dietzen, Frank Pfenning