1429 search results - page 70 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
We address the issue of regularizing Osher and Rudin's shock filter, used for image deblurring, in order to allow processes that are more robust against noise. Previous soluti...
ISMVL
1994
IEEE
14 years 1 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
SIAMJO
2008
13 years 9 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
ICIP
2002
IEEE
14 years 11 months ago
2002
IEEE
We consider the estimation of an unknown arbitrary 2D object shape from sparse noisy samples of its Fourier transform. The estimate of the closed boundarycurve is parametrized by ...
AAIM
2005
Springer
14 years 2 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...