2516 search results - page 21 / 504 » When is there a representer theorem |
143
click to vote
DM
1999
15 years 5 months ago
1999
If : L L is a bijection from the set of lines of a linear space (P, L) onto the set of lines of a linear space (P , L ) (dim (P, L), dim (P , L ) 3), such that intersecting lin...
189
Voted
AISC
2006
Springer
15 years 10 months ago
2006
Springer
We present a search engine for mathematical formulae. The MathWebSearch system harvests the web for content representations (currently MathML and OpenMath) of formulae and indexes ...
157
click to vote
JSYML
2006
15 years 6 months ago
2006
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a s...
178
Voted
ECCC
2010
15 years 4 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
173
click to vote
FLAIRS
2004
15 years 7 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...