Sciweavers

1469 search results - page 128 / 294
» Approximate polynomial decomposition
Sort
View
NA
2007
120views more  NA 2007»
14 years 9 months ago
On choosing "optimal" shape parameters for RBF approximation
Many radial basis function (RBF) methods contain a free shape parameter that plays an important role for the accuracy of the method. In most papers the authors end up choosing this...
Gregory E. Fasshauer, Jack G. Zhang
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
15 years 6 months ago
System-wide energy minimization for real-time tasks: lower bound and approximation
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
Xiliang Zhong, Cheng-Zhong Xu
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 4 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
FOCS
2005
IEEE
15 years 3 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
15 years 3 months ago
Approximating the Bandwidth of Caterpillars
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Uriel Feige, Kunal Talwar