<h1>Chandrasekaran, Venkat</h1>
<h2>Book Chapter from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Soh, Yong Sheng and Chandrasekaran, Venkat (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151007-111059602">High-dimensional change-point estimation: Combining filtering with convex optimization</a>; ISBN 978-1-4673-7704-1; 2015 IEEE International Symposium on Information Theory; 151-155; <a href="https://doi.org/10.1109/ISIT.2015.7282435">10.1109/ISIT.2015.7282435</a></li>
<li>Chandrasekaran, Venkat and Shah, Parikshit (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150430-092047133">Conic Geometric Programming</a>; ISBN 978-1-4799-3001-2; 48th Annual Conference on Information Sciences and Systems; 1-4; <a href="https://doi.org/10.1109/CISS.2014.6814151">10.1109/CISS.2014.6814151</a></li>
<li>Pilanci, Mert and El Ghaoui, Laurent, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130107-155151292">Recovery of Sparse Probability Measures via Convex Programming</a></li>
<li>Chandrasekaran, Venkat and Wakin, Michael B., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121011-131626671">Surflets: a sparse representation for multidimensional functions containing smooth discontinuities</a>; ISBN 0-7803-8280-3; 2004 IEEE International Symposium on Information Theory; 565-565; <a href="https://doi.org/10.1109/ISIT.2004.1365602">10.1109/ISIT.2004.1365602</a></li>
<li>Chandrasekaran, Venkat and Johnson, Jason K., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121009-080604998">Maximum Entropy Relaxation for Graphical Model Selection given Inconsistent Statistics</a>; ISBN 978-1-4244-1197-9; IEEE/SP 14th Workshop on Statistical Signal Processing; 625-629; <a href="https://doi.org/10.1109/SSP.2007.4301334">10.1109/SSP.2007.4301334</a></li>
<li>Chandrasekaran, Venkat and Johnson, Jason K., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121008-155412807">Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis</a></li>
<li>Liu, Ying and Chandrasekaran, Venkat, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121004-153356182">Feedback Message Passing for Inference in Gaussian Graphical Models</a>; ISBN 978-1-4244-6960-4; 2010 IEEE International Symposium on Information Theory Proceedings (ISIT); 1683-1687; <a href="https://doi.org/10.1109/ISIT.2010.5513321">10.1109/ISIT.2010.5513321</a></li>
<li>Chandrasekaran, Venkat and Sanghavi, Sujay, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121008-082643123">Sparse and low-rank matrix decompositions</a>; ISBN 978-1-4244-5870-7; Forty-Seventh annual Allerton Conference on Communication, Control, and Computing; 962-967; <a href="https://doi.org/10.1109/ALLERTON.2009.5394889">10.1109/ALLERTON.2009.5394889</a></li>
<li>Choi, Myung Jin and Chandrasekaran, Venkat, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121008-111307673">Exploiting Sparse Markov and Covariance Structure in Multiresolution Models</a>; ISBN 978-1-60558-516-1; Proceedings of the 26th Annual International Conference on Machine Learning; 177-184; <a href="https://doi.org/10.1145/1553374.1553397">10.1145/1553374.1553397</a></li>
<li>Chandrasekaran, Venkat and Srebro, Nathan, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121008-154959981">Complexity of Inference in Graphical Models</a>; ISBN 0974903949; 24th Conference on Uncertainty in Artificial Intelligence and Statistics; 70-78; <a href="https://doi.org/10.48550/arXiv.1206.3240">10.48550/arXiv.1206.3240</a></li>
</ul>