486 search results - page 43 / 98 » Improved upper bounds for 3-SAT |
TIT
2008
14 years 9 months ago
2008
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
We address the problem of instantaneous, underdetermined audio source separation by time-frequency masking. Using oracle estimators, we determine experimental upper performance bo...
130
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...