115 search results - page 2 / 23 » Uniform Approximations for Transcendental Functions |
ALT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
ICMS
2010
13 years 3 months ago
2010
There is a growing interest in numeric-algebraic techniques in the computer algebra community as such techniques can speed up many applications. This paper is concerned with one su...
ARITH
2007
IEEE
13 years 11 months ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
JMLR
2012
11 years 7 months ago
2012
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...