630 search results - page 74 / 126 » Hardness results for approximating the bandwidth |
181
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
189
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
204
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
195
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Consider a scenario where a distributed signal is sparse and is acquired by various sensors that see different versions. Thus, we have a set of sparse signals with both some commo...
165
click to vote
WIMOB
2008
IEEE
16 years 1 months ago
2008
IEEE
—Wireless networking is currently dominated by radio frequency (RF) techniques. However, the soon-to-be ubiquity of LED-based lighting motivated by significant energy savings pro...