630 search results - page 12 / 126 » Hardness results for approximating the bandwidth |
104
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...
94
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
112
Voted
STOC
2003
ACM
15 years 5 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
100
Voted
FOCS
2008
IEEE
15 years 18 days ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
116
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...