4324 search results - page 150 / 865 » A Generalized Representer Theorem |
143
click to vote
CC
2010
Springer
15 years 2 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
149
click to vote
CMA
2010
15 years 2 months ago
2010
Starting with a general definition of the Laplace transform on arbitrary time scales, we specify the Laplace transform on isolated time scales, prove several properties of the Lapl...
140
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
143
click to vote
JAPLL
2010
14 years 11 months ago
2010
Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine thes...
224
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...