2252 search results - page 89 / 451 » Lower Bounds for Dynamic Algorithms |
151
click to vote
COLT
1997
Springer
15 years 5 months ago
1997
Springer
: In this paper we prove sanity-check bounds for the error of the leave-one-out cross-validation estimate of the generalization error: that is, bounds showing that the worst-case e...
ANTS
2006
Springer
15 years 5 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
112
click to vote
CGF
1998
15 years 1 months ago
1998
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
111
click to vote
JSAC
2006
15 years 1 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...