539 search results - page 51 / 108 » An Improved Upper Bound for SAT |
ALGORITHMICA
2008
13 years 7 months ago
2008
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
TIT
2008
13 years 7 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
13 years 6 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
14 years 2 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...