545 search results - page 14 / 109 » Simultaneous approximation by greedy algorithms |
101
click to vote
ACIVS
2008
Springer
15 years 6 months ago
2008
Springer
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
96
Voted
CPC
2007
14 years 11 months ago
2007
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
110
click to vote
SIAMSC
2010
14 years 10 months ago
2010
In this paper, we develop a fast multilevel algorithm for simultaneously denoising and deblurring images under the total variation regularization. Although much effort has been de...
STRINGOLOGY
2004
15 years 1 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
121
click to vote
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...