4894 search results - page 139 / 979 » The Guarding Problem - Complexity and Approximation |
128
click to vote
ICASSP
2008
IEEE
16 years 26 days ago
2008
IEEE
This paper explores the approximation properties of a unique basis expansion, which realizes a bilinear frequency warping between a continuous-time signal and its discrete-time re...
158
click to vote
FCT
2007
Springer
16 years 17 days ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
132
click to vote
ADCM
2005
15 years 6 months ago
2005
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...
165
click to vote
TSP
2008
15 years 6 months ago
2008
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...
171
click to vote
DAM
1999
15 years 6 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...