(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
We propose a new research direction to reinvigorate research into better understanding of the M/G/K and other queueing systems-via obtaining tight bounds on the mean waiting time as functions of the moments of the service distribution. Analogous to the classical Markov-Krein theorem, we conjecture that the bounds on the mean waiting time are achieved by service distributions corresponding to the upper/lower principal representations of the moment sequence. We present analytical, numerical, and simulation evidence in support of our conjectures. © 2011 Springer Science+Business Media, LLC.
Eric Price, David P. Woodruff
FOCS 2011
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory