545 search results - page 32 / 109 » Simultaneous approximation by greedy algorithms |
COMGEO
1999
ACM
13 years 8 months ago
1999
ACM
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
SMI
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
FOCS
2004
IEEE
14 years 7 days ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper we propose novel algorithms for image restoration and parameter estimation with a Generalized Gaussian Markov Random Field prior utilizing variational distribution a...