179 search results - page 14 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
ALGORITHMICA
2010
14 years 11 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
MOC
2000
14 years 11 months ago
2000
Conservative linear equations arise in many areas of application, including continuum mechanics or high-frequency geometrical optics approximations. This kind of equation admits mo...
FSTTCS
2004
Springer
15 years 4 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
ICALP
2000
Springer
15 years 2 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
179
click to vote
COMPGEOM
2011
ACM
14 years 2 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...