☰

Narayana Santhanam, Ph.D. - Publications

Affiliations: 
2006 University of California, San Diego, La Jolla, CA 
Area:
Electronics and Electrical Engineering
Tree Info Similar researchers PubMed Report error

22 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2014 Santhanam NP, Sarwate AD, Woo JO. Redundancy of exchangeable estimators Entropy. 16: 5339-5357. DOI: 10.3390/E16105339  0.311
2014 Hosseini M, Santhanam N. Characterizing the asymptotic per-symbol redundancy of memoryless sources over countable alphabets in terms of single-letter marginals Entropy. 16: 4168-4184. DOI: 10.3390/E16074168  0.392
2010 Acharya J, Das H, Orlitsky A, Pan S, Santhanam NP. Classification using pattern probability estimators Ieee International Symposium On Information Theory - Proceedings. 1493-1497. DOI: 10.1109/ISIT.2010.5513570  0.691
2008 Das H, Orlitsky A, Santhanam NP, Zhang J. Further results on relative redundancy Ieee International Symposium On Information Theory - Proceedings. 1940-1943. DOI: 10.1109/ISIT.2008.4595327  0.656
2007 Santhanam NP, Orlitsky A, Viswanathan K. New tricks for old dogs: Large alphabet probability estimation 2007 Ieee Information Theory Workshop, Itw 2007, Proceedings. 638-643. DOI: 10.1109/ITW.2007.4313149  0.598
2007 Orlitsky A, Santhanam NP, Viswanathan K. Population estimation with performance guarantees Ieee International Symposium On Information Theory - Proceedings. 2026-2030. DOI: 10.1109/ISIT.2007.4557157  0.572
2006 Orlitsky A, Santhanam NP, Viswanathan K, Zhang J. Limit results on pattern entropy Ieee Transactions On Information Theory. 52: 2954-2964. DOI: 10.1109/TIT.2006.876351  0.662
2006 Orlitsky A, Santhanam N, Zhang J. Relative redundancy for large alphabets Ieee International Symposium On Information Theory - Proceedings. 2672-2676. DOI: 10.1109/ISIT.2006.262138  0.658
2006 Orlitsky A, Santhanam N, Viswanathan K, Zhang J. Theoretical and experimental results on modeling low probabilities 2006 Ieee Information Theory Workshop, Itw 2006. 242-246.  0.619
2005 Orlitsky A, Santhanam N, Viswanathan K, Zhang J. Convergence of profile based estimators Ieee International Symposium On Information Theory - Proceedings. 2005: 1843-1847. DOI: 10.1109/ISIT.2005.1523664  0.655
2005 Jevtić N, Orlitsky A, Santhanam NP. A lower bound on compression of unknown alphabets Theoretical Computer Science. 332: 293-311. DOI: 10.1016/J.Tcs.2004.10.038  0.738
2005 Orlitsky A, Santhanam NP. On the redundancy of Gaussian distributions 43rd Annual Allerton Conference On Communication, Control and Computing 2005. 2: 1016-1025.  0.648
2004 Orlitsky A, Santhanam NP, Viswanathan K, Zhang J. Limit results on pattern entropy 2004 Ieee Information Theory Workshop - Proceedings, Itw. 99-104. DOI: 10.1109/Tit.2006.876351  0.687
2004 Orlitsky A, Santhanam NP. Speaking of infinity Ieee Transactions On Information Theory. 50: 2215-2230. DOI: 10.1109/Tit.2004.834734  0.635
2004 Orlitsky A, Santhanam NP, Zhang J. Universal compression of memoryless sources over unknown alphabets Ieee Transactions On Information Theory. 50: 1469-1481. DOI: 10.1109/Tit.2004.830761  0.714
2004 Orlitsky A, Santhanam NP, Zhang J. Relative redundancy: A more stringent performance guarantee for universal compression Ieee International Symposium On Information Theory - Proceedings. 25.  0.665
2004 Orlitsky A, Sajama, Santhanam N, Viswanathan K, Zhang J. Algorithms for modeling distributions over large alphabets Ieee International Symposium On Information Theory - Proceedings. 306.  0.634
2003 Orlitsky A, Santhanam NP, Zhang J. Always Good Turing: asymptotically optimal probability estimation. Science (New York, N.Y.). 302: 427-31. PMID 14564004 DOI: 10.1126/Science.1088284  0.695
2003 Orlitsky A, Santhanam NP. Performance of universal codes over infinite alphabets Data Compression Conference Proceedings. 2003: 402-410. DOI: 10.1109/DCC.2003.1194031  0.561
2003 Orlitsky A, Santhanam NP, Zhang J. Always Good-Turing: Asymptotically optimal probability estimation Annual Symposium On Foundations of Computer Science - Proceedings. 179-188.  0.609
2003 Orlitsky A, Santhanam NP, Zhang J. Bounds on compression of unknown alphabets Ieee International Symposium On Information Theory - Proceedings. 111.  0.663
2002 Jevtić N, Orlitsky A, Santhanam N. Universal compression of unknown alphabets Ieee International Symposium On Information Theory - Proceedings. 320.  0.584
Show low-probability matches.