2516 search results - page 29 / 504 » When is there a representer theorem |
112
click to vote
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
In Theorem 6.1 of [3] it was shown that, when v = r + c - 1, every triple array TA(v, k, rr, cc, k : r ? c) is a balanced grid BG(v, k, k : r?c). Here we prove the converse of thi...
174
click to vote
SIAMMA
2011
15 years 1 months ago
2011
We consider solutions to a nonlinear reaction diffusion equation when the reaction term varies randomly with respect to the spatial coordinate. The nonlinearity is either the ign...
168
click to vote
LSSC
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. The purpose of this paper is to comment a frequent observation by the engineers studying acoustic scattering. It is related to the convergence of the GMRES method when so...
204
click to vote
ICLP
1994
Springer
15 years 10 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
181
click to vote
IANDC
2008
15 years 6 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...