Sciweavers

1469 search results - page 45 / 294
» Approximate polynomial decomposition
Sort
View
MOR
2000
90views more  MOR 2000»
14 years 9 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
CAGD
2006
90views more  CAGD 2006»
14 years 9 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
ADCM
2005
79views more  ADCM 2005»
14 years 9 months ago
Flexible piecewise approximations based on partition of unity
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
Weimin Han, Wing Kam Liu
TNN
2008
112views more  TNN 2008»
14 years 9 months ago
Multilayer Perceptrons: Approximation Order and Necessary Number of Hidden Units
Abstract--This paper considers the approximation of sufficiently smooth multivariable functions with a multilayer perceptron (MLP). For a given approximation order explicit formula...
S. Trenn
ECML
2004
Springer
15 years 3 months ago
Inducing Polynomial Equations for Regression
Regression methods aim at inducing models of numeric data. While most state-of-the-art machine learning methods for regression focus on inducing piecewise regression models (regres...
Ljupco Todorovski, Peter Ljubic, Saso Dzeroski