Sciweavers

3096 search results - page 91 / 620
» The Generalized FITC Approximation
Sort
View
COCOA
2008
Springer
13 years 10 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
EUSFLAT
2001
108views Fuzzy Logic» more  EUSFLAT 2001»
13 years 10 months ago
Approximate equality is no fuzzy equality
We argue that fuzzy equivalences, and in particular fuzzy equalities, in general are not suitable to model approximate equality due to the notion of transitivity. Using them for t...
Martine De Cock, Etienne E. Kerre
UAI
2004
13 years 10 months ago
On-line Prediction with Kernels and the Complexity Approximation Principle
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
Alexander Gammerman, Yuri Kalnishkan, Vladimir Vov...
CAGD
2006
94views more  CAGD 2006»
13 years 8 months ago
High order approximation of rational curves by polynomial curves
We show that many rational parametric curves can be interpolated, in a Hermite sense, by polynomial curves whose degree, relative to the number of data being interpolated, is lowe...
Michael S. Floater
JAT
2008
57views more  JAT 2008»
13 years 8 months ago
Sharp approximations to the Bernoulli periodic functions by trigonometric polynomials
We obtain optimal trigonometric polynomials of a given degree N that majorize, minorize and approximate in L1(R/Z) the Bernoulli periodic functions. These are the periodic analogue...
Emanuel Carneiro