7930 search results - page 405 / 1586 » Greedy in Approximation Algorithms |
147
click to vote
ICANNGA
2007
Springer
16 years 29 days ago
2007
Springer
Rates of approximation by networks with Gaussian RBFs with varying widths are investigated. For certain smooth functions, upper bounds are derived in terms of a Sobolev-equivalent ...
188
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
182
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
We present an algorithm for computing a robust adaptive polygonal approximation of an implicit curve in the plane. The approximation is adapted to the geometry of the curve because...
175
click to vote
TCC
2007
Springer
16 years 28 days ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
196
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper targets energy-efficient scheduling of tasks over multiple processors, where tasks share a common deadline. Distinct from many research results on heuristics-based ener...