Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is defined to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under-every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is implied by stability of an associated fluid queueing network.
Eric Price, David P. Woodruff
FOCS 2011
Thomas M. Cheng
IT Professional
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Thomas M. Cover
IEEE Trans. Inf. Theory