Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
Upper bounds on the entropy of a countable integer-valued random variable are furnished in terms of the expectation of the logarithm function. In particular, an upper boundisderived that is sharper than that of Elias, H(P) ≤ EP(log) + 2(1 + √Ep(log)), for all values of Ep(log). Bounds that are better only for large values of Ep(log) than the previous known upper bounds are also provided. © 1988 IEEE
Eric Price, David P. Woodruff
FOCS 2011
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
G. Ramalingam
Theoretical Computer Science
Raymond Wu, Jie Lu
ITA Conference 2007