12519 search results - page 210 / 2504 » Approximation Problems Categories |
321
click to vote
COMPGEOM
2011
ACM
14 years 10 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...
173
click to vote
COCO
2005
Springer
16 years 20 days ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
181
click to vote
ADCM
2007
15 years 7 months ago
2007
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
131
click to vote
APPML
2008
15 years 7 months ago
2008
The present work is concerned with the uniqueness problem of best simultaneous approximation. An n-dimensional l1- or l-simultaneous unicity space is characterized in terms of Pro...
166
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...