93 search results - page 8 / 19 » Conditional hardness for approximate coloring |
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
ACTA
2008
13 years 7 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...
SIGGRAPH
2003
ACM
14 years 21 days ago
2003
ACM
We present techniques which create a consistent illumination between real and virtual objects inside an application specific optical see-through display: the Virtual Showcase. We ...