28 search results - page 1 / 6 » An asymptotic Lower Bound for the Maximal Number of Runs in ... |
IJFCS
2008
13 years 4 months ago
2008
LATA
2009
Springer
13 years 11 months ago
2009
Springer
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
WDAG
2010
Springer
13 years 3 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,...
SPAA
1993
ACM
13 years 9 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...
NIPS
2004
13 years 6 months ago
2004
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...