Conference paper
A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 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
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)