2516 search results - page 38 / 504 » When is there a representer theorem |
150
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between ...
139
click to vote
SIGACT
2008
15 years 6 months ago
2008
The soundness error of a PCP verifier is the probability (usually denoted ) that the verifier accepts an incorrect input. We are interested in the smallest possible values of for...
153
click to vote
JSC
2007
15 years 6 months ago
2007
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
159
click to vote
APAL
1999
15 years 5 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
157
click to vote
TIME
2008
IEEE
16 years 17 days ago
2008
IEEE
Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed...