3341 search results - page 39 / 669 » On Bounded Queries and Approximation |
104
click to vote
MFCS
2009
Springer
15 years 2 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
JAT
2007
14 years 9 months ago
2007
Quantitative bounds on rates of approximation by linear combinations of Heaviside plane waves are obtained for sufficiently differentiable functions f which vanish rapidly enough...
IWANN
2009
Springer
15 years 2 months ago
2009
Springer
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
CPM
2008
Springer
14 years 11 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
JAT
2010
14 years 8 months ago
2010
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...