K
Krishnamurthy Viswanathan
Researcher at Hewlett-Packard
Publications - 74
Citations - 1399
Krishnamurthy Viswanathan is an academic researcher from Hewlett-Packard. The author has contributed to research in topics: Estimator & Entropy rate. The author has an hindex of 19, co-authored 72 publications receiving 1303 citations. Previous affiliations of Krishnamurthy Viswanathan include University of California, San Diego & Google.
Papers
More filters
Journal ArticleDOI
Stopping set distribution of LDPC code ensembles
TL;DR: Several results on the asymptotic behavior of stopping sets in Tanner-graph ensembles are derived, including an expression for the normalized average stopping set distribution, yielding a critical fraction of the block length above which codes have exponentially many stopping sets of that size.
Proceedings ArticleDOI
Statistical techniques for online anomaly detection in data centers
Chengwei Wang,Krishnamurthy Viswanathan,Lakshminarayan Choudur,Vanish Talwar,Wade J. Satterfield,Karsten Schwan +5 more
TL;DR: This paper presents statistical techniques based on the Tukey and Relative Entropy statistics, and applies them to data collected from a production environment and to data captured from a testbed for multi-tier web applications running on server class machines.
Proceedings ArticleDOI
Stopping sets and the girth of Tanner graphs
TL;DR: This work considers the size of the smallest stopping set in any bipartite graph of girth g and left degree d, and bounds it in terms of d, showing that for fixed d, /spl sigma/(d,g) grows exponentially with g.
Proceedings ArticleDOI
On modeling profiles instead of values
TL;DR: In this article, the authors consider the problem of estimating the distribution underlying an observed sample of data and propose a different estimate, the high-profile distribution, which maximizes the probability of the observed profile.
Proceedings Article
Improved string reconstruction over insertion-deletion channels
TL;DR: It is shown that to reconstruct most strings reliably over any channel with a constant flip probability, transmissions are necessary, and therefore the algorithm is efficient in this sense.