\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n

\n generated by\n \n $\"bibbase.org\"\n$ \n \n

\n \n\n

\n\n

\n \n Group by\n \n \n
- \n Year\n
- \n Author\n
- \n Type\n
- \n Keyword\n
- \n Downloads\n
\n
\n \n \n \n \n
- \n \n Expand/Collapse All\n \n
- \n \n Download BibTeX\n \n
- \n \n RSS Feed\n \n
\n

\n\n\n

\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n

\n JavaScript\n (easiest)\n

\n \n <script src=\"https://bibbase.org/dblp/venkatesh_saligrama?jsonp=1&jsonp=1\"></script>\n \n

\n\n PHP\n

\n            <?php\n            $contents = file_get_contents(\"https://bibbase.org/dblp/venkatesh_saligrama?jsonp=1\");\n            print_r($contents);\n            ?>\n

\n\n iFrame\n (not recommended)\n

\n \n <iframe src=\"https://bibbase.org/dblp/venkatesh_saligrama?jsonp=1\"></iframe>\n \n

\n\n

\n For more details see the documention.\n

\n\n

\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n

\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

renew the authorization for BibBase on Mendeley, and
update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n

\n\n

\n \n \n Fix it now\n

\n\n

\n\n\n

\n \n \n

\n \n 2024\n \n \n (2)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Interpretable Compositional Representations for Robust Few-Shot Generalization.\n \n \n \n \n\n\n \n Mishra, S.; Zhu, P.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Pattern Anal. Mach. Intell., 46(3): 1496–1512. 2024.\n \n\n\n\n
\n\n\n\n \n \n $\"Interpretable$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/pami/MishraZS24,\n  author       = {Samarth Mishra and\n                  Pengkai Zhu and\n                  Venkatesh Saligrama},\n  title        = {Interpretable Compositional Representations for Robust Few-Shot Generalization},\n  journal      = {{IEEE} Trans. Pattern Anal. Mach. Intell.},\n  volume       = {46},\n  number       = {3},\n  pages        = {1496--1512},\n  year         = {2024},\n  url          = {https://doi.org/10.1109/TPAMI.2022.3212633},\n  doi          = {10.1109/TPAMI.2022.3212633},\n  timestamp    = {Thu, 29 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/pami/MishraZS24.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n SynCDR : Training Cross Domain Retrieval Models with Synthetic Data.\n \n \n \n \n\n\n \n Mishra, S.; Saenko, K.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2401.00420. 2024.\n \n\n\n\n
\n\n\n\n \n \n $\"SynCDR$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2401-00420,\n  author       = {Samarth Mishra and\n                  Kate Saenko and\n                  Venkatesh Saligrama},\n  title        = {SynCDR : Training Cross Domain Retrieval Models with Synthetic Data},\n  journal      = {CoRR},\n  volume       = {abs/2401.00420},\n  year         = {2024},\n  url          = {https://doi.org/10.48550/arXiv.2401.00420},\n  doi          = {10.48550/ARXIV.2401.00420},\n  eprinttype    = {arXiv},\n  eprint       = {2401.00420},\n  timestamp    = {Mon, 15 Jan 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2401-00420.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2023\n \n \n (10)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Ideology Prediction from Scarce and Biased Supervision: Learn to Disregard the \"What\" and Focus on the \"How\"!.\n \n \n \n \n\n\n \n Chen, C.; Walker, D.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), ACL 2023, Toronto, Canada, July 9-14, 2023, pages 9529–9549, 2023. \n \n\n\n\n
\n\n\n\n \n \n $\"Ideology$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/acl/ChenWS23a,\n  author       = {Chen Chen and\n                  Dylan Walker and\n                  Venkatesh Saligrama},\n  title        = {Ideology Prediction from Scarce and Biased Supervision: Learn to Disregard\n                  the "What" and Focus on the "How"!},\n  booktitle    = {Proceedings of the 61st Annual Meeting of the Association for Computational\n                  Linguistics (Volume 1: Long Papers), {ACL} 2023, Toronto, Canada,\n                  July 9-14, 2023},\n  pages        = {9529--9549},\n  year         = {2023},\n  crossref     = {DBLP:conf/acl/2023-1},\n  url          = {https://doi.org/10.18653/v1/2023.acl-long.530},\n  doi          = {10.18653/V1/2023.ACL-LONG.530},\n  timestamp    = {Thu, 10 Aug 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/acl/ChenWS23a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Fine-grained Few-shot Recognition by Deep Object Parsing.\n \n \n \n \n\n\n \n Zhu, R.; Zhu, P.; Mishra, S.; and Saligrama, V.\n\n\n \n\n\n\n In 34th British Machine Vision Conference 2023, BMVC 2023, Aberdeen, UK, November 20-24, 2023, pages 330–331, 2023. \n \n\n\n\n
\n\n\n\n \n \n $\"Fine-grained$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/bmvc/ZhuZMS23,\n  author       = {Ruizhao Zhu and\n                  Pengkai Zhu and\n                  Samarth Mishra and\n                  Venkatesh Saligrama},\n  title        = {Fine-grained Few-shot Recognition by Deep Object Parsing},\n  booktitle    = {34th British Machine Vision Conference 2023, {BMVC} 2023, Aberdeen,\n                  UK, November 20-24, 2023},\n  pages        = {330--331},\n  year         = {2023},\n  crossref     = {DBLP:conf/bmvc/2023},\n  url          = {http://proceedings.bmvc2023.org/330/},\n  timestamp    = {Mon, 11 Mar 2024 15:42:29 +0100},\n  biburl       = {https://dblp.org/rec/conf/bmvc/ZhuZMS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning to Drive Anywhere.\n \n \n \n \n\n\n \n Zhu, R.; Huang, P.; Ohn-Bar, E.; and Saligrama, V.\n\n\n \n\n\n\n In Conference on Robot Learning, CoRL 2023, 6-9 November 2023, Atlanta, GA, USA, pages 3631–3653, 2023. \n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/corl/ZhuHOS23,\n  author       = {Ruizhao Zhu and\n                  Peng Huang and\n                  Eshed Ohn{-}Bar and\n                  Venkatesh Saligrama},\n  title        = {Learning to Drive Anywhere},\n  booktitle    = {Conference on Robot Learning, CoRL 2023, 6-9 November 2023, Atlanta,\n                  GA, {USA}},\n  pages        = {3631--3653},\n  year         = {2023},\n  crossref     = {DBLP:conf/corl/2023},\n  url          = {https://proceedings.mlr.press/v229/zhu23c.html},\n  timestamp    = {Tue, 20 Feb 2024 12:11:46 +0100},\n  biburl       = {https://dblp.org/rec/conf/corl/ZhuHOS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Scaffolding a Student to Instill Knowledge.\n \n \n \n \n\n\n \n Kag, A.; Acar, D. A. E.; Gangrade, A.; and Saligrama, V.\n\n\n \n\n\n\n In The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023, 2023. \n \n\n\n\n
\n\n\n\n \n \n $\"Scaffolding$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/iclr/KagAGS23,\n  author       = {Anil Kag and\n                  Durmus Alp Emre Acar and\n                  Aditya Gangrade and\n                  Venkatesh Saligrama},\n  title        = {Scaffolding a Student to Instill Knowledge},\n  booktitle    = {The Eleventh International Conference on Learning Representations,\n                  {ICLR} 2023, Kigali, Rwanda, May 1-5, 2023},\n  year         = {2023},\n  crossref     = {DBLP:conf/iclr/2023},\n  url          = {https://openreview.net/pdf?id=N4K5ck-BTT},\n  timestamp    = {Fri, 30 Jun 2023 14:38:38 +0200},\n  biburl       = {https://dblp.org/rec/conf/iclr/KagAGS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Edge Inference by Selective Query.\n \n \n \n \n\n\n \n Kag, A.; Fedorov, I.; Gangrade, A.; Whatmough, P. N.; and Saligrama, V.\n\n\n \n\n\n\n In The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023, 2023. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/iclr/KagFGWS23,\n  author       = {Anil Kag and\n                  Igor Fedorov and\n                  Aditya Gangrade and\n                  Paul N. Whatmough and\n                  Venkatesh Saligrama},\n  title        = {Efficient Edge Inference by Selective Query},\n  booktitle    = {The Eleventh International Conference on Learning Representations,\n                  {ICLR} 2023, Kigali, Rwanda, May 1-5, 2023},\n  year         = {2023},\n  crossref     = {DBLP:conf/iclr/2023},\n  url          = {https://openreview.net/pdf?id=jpR98ZdIm2q},\n  timestamp    = {Fri, 30 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iclr/KagFGWS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n InfoCD: A Contrastive Chamfer Distance Loss for Point Cloud Completion.\n \n \n \n \n\n\n \n Lin, F.; Yue, Y.; Zhang, Z.; Hou, S.; Yamada, K. D.; Kolachalama, V.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023. \n \n\n\n\n
\n\n\n\n \n \n $\"InfoCD:$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/LinYZHYKS23,\n  author       = {Fangzhou Lin and\n                  Yun Yue and\n                  Ziming Zhang and\n                  Songlin Hou and\n                  Kazunori D. Yamada and\n                  Vijaya Kolachalama and\n                  Venkatesh Saligrama},\n  title        = {InfoCD: {A} Contrastive Chamfer Distance Loss for Point Cloud Completion},\n  booktitle    = {Advances in Neural Information Processing Systems 36: Annual Conference\n                  on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,\n                  LA, USA, December 10 - 16, 2023},\n  year         = {2023},\n  crossref     = {DBLP:conf/nips/2023},\n  url          = {http://papers.nips.cc/paper\\_files/paper/2023/hash/f2ea1943896474b7cd9796b93e526f6f-Abstract-Conference.html},\n  timestamp    = {Fri, 01 Mar 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/nips/LinYZHYKS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Human Action Recognition Representations Without Real Humans.\n \n \n \n \n\n\n \n Zhong, H.; Mishra, S.; Kim, D.; Jin, S.; Panda, R.; Kuehne, H.; Karlinsky, L.; Saligrama, V.; Oliva, A.; and Feris, R.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023. \n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/ZhongMKJPKKSOF23,\n  author       = {Howard Zhong and\n                  Samarth Mishra and\n                  Donghyun Kim and\n                  SouYoung Jin and\n                  Rameswar Panda and\n                  Hilde Kuehne and\n                  Leonid Karlinsky and\n                  Venkatesh Saligrama and\n                  Aude Oliva and\n                  Rog{\\'{e}}rio Feris},\n  title        = {Learning Human Action Recognition Representations Without Real Humans},\n  booktitle    = {Advances in Neural Information Processing Systems 36: Annual Conference\n                  on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,\n                  LA, USA, December 10 - 16, 2023},\n  year         = {2023},\n  crossref     = {DBLP:conf/nips/2023},\n  url          = {http://papers.nips.cc/paper\\_files/paper/2023/hash/cd556f38dba3a6c367c42fa85fc0801c-Abstract-Datasets\\_and\\_Benchmarks.html},\n  timestamp    = {Fri, 01 Mar 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/nips/ZhongMKJPKKSOF23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Filtering Context Mitigates Scarcity and Selection Bias in Political Ideology Prediction.\n \n \n \n \n\n\n \n Chen, C.; Walker, D.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2302.00239. 2023.\n \n\n\n\n
\n\n\n\n \n \n $\"Filtering$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2302-00239,\n  author       = {Chen Chen and\n                  Dylan Walker and\n                  Venkatesh Saligrama},\n  title        = {Filtering Context Mitigates Scarcity and Selection Bias in Political\n                  Ideology Prediction},\n  journal      = {CoRR},\n  volume       = {abs/2302.00239},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2302.00239},\n  doi          = {10.48550/ARXIV.2302.00239},\n  eprinttype    = {arXiv},\n  eprint       = {2302.00239},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2302-00239.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning to Drive Anywhere.\n \n \n \n \n\n\n \n Zhu, R.; Huang, P.; Ohn-Bar, E.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2309.12295. 2023.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2309-12295,\n  author       = {Ruizhao Zhu and\n                  Peng Huang and\n                  Eshed Ohn{-}Bar and\n                  Venkatesh Saligrama},\n  title        = {Learning to Drive Anywhere},\n  journal      = {CoRR},\n  volume       = {abs/2309.12295},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2309.12295},\n  doi          = {10.48550/ARXIV.2309.12295},\n  eprinttype    = {arXiv},\n  eprint       = {2309.12295},\n  timestamp    = {Mon, 25 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2309-12295.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Human Action Recognition Representations Without Real Humans.\n \n \n \n \n\n\n \n Zhong, H.; Mishra, S.; Kim, D.; Jin, S.; Panda, R.; Kuehne, H.; Karlinsky, L.; Saligrama, V.; Oliva, A.; and Feris, R.\n\n\n \n\n\n\n CoRR, abs/2311.06231. 2023.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2311-06231,\n  author       = {Howard Zhong and\n                  Samarth Mishra and\n                  Donghyun Kim and\n                  SouYoung Jin and\n                  Rameswar Panda and\n                  Hilde Kuehne and\n                  Leonid Karlinsky and\n                  Venkatesh Saligrama and\n                  Aude Oliva and\n                  Rog{\\'{e}}rio Feris},\n  title        = {Learning Human Action Recognition Representations Without Real Humans},\n  journal      = {CoRR},\n  volume       = {abs/2311.06231},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2311.06231},\n  doi          = {10.48550/ARXIV.2311.06231},\n  eprinttype    = {arXiv},\n  eprint       = {2311.06231},\n  timestamp    = {Wed, 15 Nov 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2311-06231.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2022\n \n \n (11)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Condensing CNNs with Partial Differential Equations.\n \n \n \n \n\n\n \n Kag, A.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2022, New Orleans, LA, USA, June 18-24, 2022, pages 600–609, 2022. \n \n\n\n\n
\n\n\n\n \n \n $\"Condensing$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/KagS22,\n  author       = {Anil Kag and\n                  Venkatesh Saligrama},\n  title        = {Condensing CNNs with Partial Differential Equations},\n  booktitle    = {{IEEE/CVF} Conference on Computer Vision and Pattern Recognition,\n                  {CVPR} 2022, New Orleans, LA, USA, June 18-24, 2022},\n  pages        = {600--609},\n  year         = {2022},\n  crossref     = {DBLP:conf/cvpr/2022},\n  url          = {https://doi.org/10.1109/CVPR52688.2022.00069},\n  doi          = {10.1109/CVPR52688.2022.00069},\n  timestamp    = {Tue, 04 Oct 2022 15:11:56 +0200},\n  biburl       = {https://dblp.org/rec/conf/cvpr/KagS22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Task2Sim: Towards Effective Pre-training and Transfer from Synthetic Data.\n \n \n \n \n\n\n \n Mishra, S.; Panda, R.; Phoo, C. P.; Chen, C. R.; Karlinsky, L.; Saenko, K.; Saligrama, V.; and Feris, R. S.\n\n\n \n\n\n\n In IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2022, New Orleans, LA, USA, June 18-24, 2022, pages 9184–9194, 2022. \n \n\n\n\n
\n\n\n\n \n \n $\"Task2Sim:$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/MishraPPCKSSF22,\n  author       = {Samarth Mishra and\n                  Rameswar Panda and\n                  Cheng Perng Phoo and\n                  Chun{-}Fu Richard Chen and\n                  Leonid Karlinsky and\n                  Kate Saenko and\n                  Venkatesh Saligrama and\n                  Rog{\\'{e}}rio Schmidt Feris},\n  title        = {Task2Sim: Towards Effective Pre-training and Transfer from Synthetic\n                  Data},\n  booktitle    = {{IEEE/CVF} Conference on Computer Vision and Pattern Recognition,\n                  {CVPR} 2022, New Orleans, LA, USA, June 18-24, 2022},\n  pages        = {9184--9194},\n  year         = {2022},\n  crossref     = {DBLP:conf/cvpr/2022},\n  url          = {https://doi.org/10.1109/CVPR52688.2022.00898},\n  doi          = {10.1109/CVPR52688.2022.00898},\n  timestamp    = {Wed, 05 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/cvpr/MishraPPCKSSF22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and Risk.\n \n \n \n \n\n\n \n Chen, T.; Gangrade, A.; and Saligrama, V.\n\n\n \n\n\n\n In International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA, pages 3123–3148, 2022. \n \n\n\n\n
\n\n\n\n \n \n $\"Strategies$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/ChenGS22,\n  author       = {Tianrui Chen and\n                  Aditya Gangrade and\n                  Venkatesh Saligrama},\n  title        = {Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and\n                  Risk},\n  booktitle    = {International Conference on Machine Learning, {ICML} 2022, 17-23 July\n                  2022, Baltimore, Maryland, {USA}},\n  pages        = {3123--3148},\n  year         = {2022},\n  crossref     = {DBLP:conf/icml/2022},\n  url          = {https://proceedings.mlr.press/v162/chen22e.html},\n  timestamp    = {Tue, 12 Jul 2022 17:36:52 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/ChenGS22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n ActiveHedge: Hedge meets Active Learning.\n \n \n \n \n\n\n \n Kumar, B.; Abernethy, J. D.; and Saligrama, V.\n\n\n \n\n\n\n In International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA, pages 11694–11709, 2022. \n \n\n\n\n
\n\n\n\n \n \n $\"ActiveHedge:$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/KumarAS22,\n  author       = {Bhuvesh Kumar and\n                  Jacob D. Abernethy and\n                  Venkatesh Saligrama},\n  title        = {ActiveHedge: Hedge meets Active Learning},\n  booktitle    = {International Conference on Machine Learning, {ICML} 2022, 17-23 July\n                  2022, Baltimore, Maryland, {USA}},\n  pages        = {11694--11709},\n  year         = {2022},\n  crossref     = {DBLP:conf/icml/2022},\n  url          = {https://proceedings.mlr.press/v162/kumar22a.html},\n  timestamp    = {Tue, 12 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/KumarAS22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Faster Algorithms for Learning Convex Functions.\n \n \n \n \n\n\n \n Siahkamari, A.; Acar, D. A. E.; Liao, C.; Geyer, K. L.; Saligrama, V.; and Kulis, B.\n\n\n \n\n\n\n In International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA, pages 20176–20194, 2022. \n \n\n\n\n
\n\n\n\n \n \n $\"Faster$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/SiahkamariALGSK22,\n  author       = {Ali Siahkamari and\n                  Durmus Alp Emre Acar and\n                  Christopher Liao and\n                  Kelly L. Geyer and\n                  Venkatesh Saligrama and\n                  Brian Kulis},\n  title        = {Faster Algorithms for Learning Convex Functions},\n  booktitle    = {International Conference on Machine Learning, {ICML} 2022, 17-23 July\n                  2022, Baltimore, Maryland, {USA}},\n  pages        = {20176--20194},\n  year         = {2022},\n  crossref     = {DBLP:conf/icml/2022},\n  url          = {https://proceedings.mlr.press/v162/siahkamari22a.html},\n  timestamp    = {Tue, 12 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/SiahkamariALGSK22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n How Transferable are Video Representations Based on Synthetic Data?.\n \n \n \n \n\n\n \n Kim, Y.; Mishra, S.; Jin, S.; Panda, R.; Kuehne, H.; Karlinsky, L.; Saligrama, V.; Saenko, K.; Oliva, A.; and Feris, R.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022, 2022. \n \n\n\n\n
\n\n\n\n \n \n $\"How$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/KimMJPKKSSOF22,\n  author       = {Yo{-}whan Kim and\n                  Samarth Mishra and\n                  SouYoung Jin and\n                  Rameswar Panda and\n                  Hilde Kuehne and\n                  Leonid Karlinsky and\n                  Venkatesh Saligrama and\n                  Kate Saenko and\n                  Aude Oliva and\n                  Rog{\\'{e}}rio Feris},\n  title        = {How Transferable are Video Representations Based on Synthetic Data?},\n  booktitle    = {Advances in Neural Information Processing Systems 35: Annual Conference\n                  on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,\n                  LA, USA, November 28 - December 9, 2022},\n  year         = {2022},\n  crossref     = {DBLP:conf/nips/2022},\n  url          = {http://papers.nips.cc/paper\\_files/paper/2022/hash/e8507db80464ced5658d16b49bd458b9-Abstract-Datasets\\_and\\_Benchmarks.html},\n  timestamp    = {Mon, 08 Jan 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/nips/KimMJPKKSSOF22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and Risk.\n \n \n \n \n\n\n \n Chen, T.; Gangrade, A.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2204.00706. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Strategies$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2204-00706,\n  author       = {Tianrui Chen and\n                  Aditya Gangrade and\n                  Venkatesh Saligrama},\n  title        = {Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and\n                  Risk},\n  journal      = {CoRR},\n  volume       = {abs/2204.00706},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2204.00706},\n  doi          = {10.48550/ARXIV.2204.00706},\n  eprinttype    = {arXiv},\n  eprint       = {2204.00706},\n  timestamp    = {Wed, 06 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-00706.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Compositional Representations for Effective Low-Shot Generalization.\n \n \n \n \n\n\n \n Mishra, S.; Zhu, P.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2204.08090. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2204-08090,\n  author       = {Samarth Mishra and\n                  Pengkai Zhu and\n                  Venkatesh Saligrama},\n  title        = {Learning Compositional Representations for Effective Low-Shot Generalization},\n  journal      = {CoRR},\n  volume       = {abs/2204.08090},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2204.08090},\n  doi          = {10.48550/ARXIV.2204.08090},\n  eprinttype    = {arXiv},\n  eprint       = {2204.08090},\n  timestamp    = {Tue, 19 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-08090.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n FedHeN: Federated Learning in Heterogeneous Networks.\n \n \n \n \n\n\n \n Acar, D. A. E.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2207.03031. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"FedHeN:$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2207-03031,\n  author       = {Durmus Alp Emre Acar and\n                  Venkatesh Saligrama},\n  title        = {FedHeN: Federated Learning in Heterogeneous Networks},\n  journal      = {CoRR},\n  volume       = {abs/2207.03031},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2207.03031},\n  doi          = {10.48550/ARXIV.2207.03031},\n  eprinttype    = {arXiv},\n  eprint       = {2207.03031},\n  timestamp    = {Wed, 13 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2207-03031.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Fine-grained Few-shot Recognition by Deep Object Parsing.\n \n \n \n \n\n\n \n Zhu, P.; Zhu, R.; Mishra, S.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2207.07110. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Fine-grained$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2207-07110,\n  author       = {Pengkai Zhu and\n                  Ruizhao Zhu and\n                  Samarth Mishra and\n                  Venkatesh Saligrama},\n  title        = {Fine-grained Few-shot Recognition by Deep Object Parsing},\n  journal      = {CoRR},\n  volume       = {abs/2207.07110},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2207.07110},\n  doi          = {10.48550/ARXIV.2207.07110},\n  eprinttype    = {arXiv},\n  eprint       = {2207.07110},\n  timestamp    = {Tue, 19 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2207-07110.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Doubly Optimistic Strategy for Safe Linear Bandits.\n \n \n \n \n\n\n \n Chen, T.; Gangrade, A.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2209.13694. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2209-13694,\n  author       = {Tianrui Chen and\n                  Aditya Gangrade and\n                  Venkatesh Saligrama},\n  title        = {A Doubly Optimistic Strategy for Safe Linear Bandits},\n  journal      = {CoRR},\n  volume       = {abs/2209.13694},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2209.13694},\n  doi          = {10.48550/ARXIV.2209.13694},\n  eprinttype    = {arXiv},\n  eprint       = {2209.13694},\n  timestamp    = {Thu, 06 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2209-13694.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2021\n \n \n (18)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Selective Classification via One-Sided Prediction.\n \n \n \n \n\n\n \n Gangrade, A.; Kag, A.; and Saligrama, V.\n\n\n \n\n\n\n In The 24th International Conference on Artificial Intelligence and Statistics, AISTATS 2021, April 13-15, 2021, Virtual Event, pages 2179–2187, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Selective$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/GangradeKS21,\n  author       = {Aditya Gangrade and\n                  Anil Kag and\n                  Venkatesh Saligrama},\n  title        = {Selective Classification via One-Sided Prediction},\n  booktitle    = {The 24th International Conference on Artificial Intelligence and Statistics,\n                  {AISTATS} 2021, April 13-15, 2021, Virtual Event},\n  pages        = {2179--2187},\n  year         = {2021},\n  crossref     = {DBLP:conf/aistats/2021},\n  url          = {http://proceedings.mlr.press/v130/gangrade21a.html},\n  timestamp    = {Wed, 14 Apr 2021 16:51:37 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/GangradeKS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Surprisingly Simple Semi-Supervised Domain Adaptation with Pretraining and Consistency.\n \n \n \n \n\n\n \n Mishra, S.; Saenko, K.; and Saligrama, V.\n\n\n \n\n\n\n In 32nd British Machine Vision Conference 2021, BMVC 2021, Online, November 22-25, 2021, pages 177, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Surprisingly$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/bmvc/MishraSS21,\n  author       = {Samarth Mishra and\n                  Kate Saenko and\n                  Venkatesh Saligrama},\n  title        = {Surprisingly Simple Semi-Supervised Domain Adaptation with Pretraining\n                  and Consistency},\n  booktitle    = {32nd British Machine Vision Conference 2021, {BMVC} 2021, Online,\n                  November 22-25, 2021},\n  pages        = {177},\n  year         = {2021},\n  crossref     = {DBLP:conf/bmvc/2021},\n  url          = {https://www.bmvc2021-virtualconference.com/assets/papers/0764.pdf},\n  timestamp    = {Wed, 22 Jun 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/bmvc/MishraSS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Effectively Leveraging Attributes for Visual Similarity.\n \n \n \n \n\n\n \n Mishra, S.; Zhang, Z.; Shen, Y.; Kumar, R.; Saligrama, V.; and Plummer, B. A.\n\n\n \n\n\n\n In IEEE Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2021, virtual, June 19-25, 2021, pages 3904–3909, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Effectively$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/MishraZSKSP21,\n  author       = {Samarth Mishra and\n                  Zhongping Zhang and\n                  Yuan Shen and\n                  Ranjitha Kumar and\n                  Venkatesh Saligrama and\n                  Bryan A. Plummer},\n  title        = {Effectively Leveraging Attributes for Visual Similarity},\n  booktitle    = {{IEEE} Conference on Computer Vision and Pattern Recognition Workshops,\n                  {CVPR} Workshops 2021, virtual, June 19-25, 2021},\n  pages        = {3904--3909},\n  year         = {2021},\n  crossref     = {DBLP:conf/cvpr/2021w},\n  url          = {https://openaccess.thecvf.com/content/CVPR2021W/CVFAD/html/Mishra\\_Effectively\\_Leveraging\\_Attributes\\_for\\_Visual\\_Similarity\\_CVPRW\\_2021\\_paper.html},\n  doi          = {10.1109/CVPRW53098.2021.00434},\n  timestamp    = {Mon, 18 Jul 2022 16:47:41 +0200},\n  biburl       = {https://dblp.org/rec/conf/cvpr/MishraZSKSP21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Time Adaptive Recurrent Neural Network.\n \n \n \n \n\n\n \n Kag, A.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2021, virtual, June 19-25, 2021, pages 15149–15158, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Time$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/KagS21,\n  author       = {Anil Kag and\n                  Venkatesh Saligrama},\n  title        = {Time Adaptive Recurrent Neural Network},\n  booktitle    = {{IEEE} Conference on Computer Vision and Pattern Recognition, {CVPR}\n                  2021, virtual, June 19-25, 2021},\n  pages        = {15149--15158},\n  year         = {2021},\n  crossref     = {DBLP:conf/cvpr/2021},\n  url          = {https://openaccess.thecvf.com/content/CVPR2021/html/Kag\\_Time\\_Adaptive\\_Recurrent\\_Neural\\_Network\\_CVPR\\_2021\\_paper.html},\n  doi          = {10.1109/CVPR46437.2021.01490},\n  timestamp    = {Mon, 18 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/cvpr/KagS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Effectively Leveraging Attributes for Visual Similarity.\n \n \n \n \n\n\n \n Mishra, S.; Zhang, Z.; Shen, Y.; Kumar, R.; Saligrama, V.; and Plummer, B. A.\n\n\n \n\n\n\n In 2021 IEEE/CVF International Conference on Computer Vision, ICCV 2021, Montreal, QC, Canada, October 10-17, 2021, pages 995–1004, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Effectively$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/iccv/MishraZSKSP21,\n  author       = {Samarth Mishra and\n                  Zhongping Zhang and\n                  Yuan Shen and\n                  Ranjitha Kumar and\n                  Venkatesh Saligrama and\n                  Bryan A. Plummer},\n  title        = {Effectively Leveraging Attributes for Visual Similarity},\n  booktitle    = {2021 {IEEE/CVF} International Conference on Computer Vision, {ICCV}\n                  2021, Montreal, QC, Canada, October 10-17, 2021},\n  pages        = {995--1004},\n  year         = {2021},\n  crossref     = {DBLP:conf/iccv/2021},\n  url          = {https://doi.org/10.1109/ICCV48922.2021.00105},\n  doi          = {10.1109/ICCV48922.2021.00105},\n  timestamp    = {Fri, 11 Mar 2022 10:01:27 +0100},\n  biburl       = {https://dblp.org/rec/conf/iccv/MishraZSKSP21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Federated Learning Based on Dynamic Regularization.\n \n \n \n \n\n\n \n Acar, D. A. E.; Zhao, Y.; Navarro, R. M.; Mattina, M.; Whatmough, P. N.; and Saligrama, V.\n\n\n \n\n\n\n In 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3-7, 2021, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Federated$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/iclr/AcarZNMWS21,\n  author       = {Durmus Alp Emre Acar and\n                  Yue Zhao and\n                  Ramon Matas Navarro and\n                  Matthew Mattina and\n                  Paul N. Whatmough and\n                  Venkatesh Saligrama},\n  title        = {Federated Learning Based on Dynamic Regularization},\n  booktitle    = {9th International Conference on Learning Representations, {ICLR} 2021,\n                  Virtual Event, Austria, May 3-7, 2021},\n  year         = {2021},\n  crossref     = {DBLP:conf/iclr/2021},\n  url          = {https://openreview.net/forum?id=B7v4QMR6Z9w},\n  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iclr/AcarZNMWS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Debiasing Model Updates for Improving Personalized Federated Training.\n \n \n \n \n\n\n \n Acar, D. A. E.; Zhao, Y.; Zhu, R.; Navarro, R. M.; Mattina, M.; Whatmough, P. N.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, pages 21–31, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Debiasing$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/AcarZZNMWS21,\n  author       = {Durmus Alp Emre Acar and\n                  Yue Zhao and\n                  Ruizhao Zhu and\n                  Ramon Matas Navarro and\n                  Matthew Mattina and\n                  Paul N. Whatmough and\n                  Venkatesh Saligrama},\n  title        = {Debiasing Model Updates for Improving Personalized Federated Training},\n  booktitle    = {Proceedings of the 38th International Conference on Machine Learning,\n                  {ICML} 2021, 18-24 July 2021, Virtual Event},\n  pages        = {21--31},\n  year         = {2021},\n  crossref     = {DBLP:conf/icml/2021},\n  url          = {http://proceedings.mlr.press/v139/acar21a.html},\n  timestamp    = {Wed, 25 Aug 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/AcarZZNMWS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Memory Efficient Online Meta Learning.\n \n \n \n \n\n\n \n Acar, D. A. E.; Zhu, R.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, pages 32–42, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Memory$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/AcarZS21,\n  author       = {Durmus Alp Emre Acar and\n                  Ruizhao Zhu and\n                  Venkatesh Saligrama},\n  title        = {Memory Efficient Online Meta Learning},\n  booktitle    = {Proceedings of the 38th International Conference on Machine Learning,\n                  {ICML} 2021, 18-24 July 2021, Virtual Event},\n  pages        = {32--42},\n  year         = {2021},\n  crossref     = {DBLP:conf/icml/2021},\n  url          = {http://proceedings.mlr.press/v139/acar21b.html},\n  timestamp    = {Wed, 25 Aug 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/AcarZS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Training Recurrent Neural Networks via Forward Propagation Through Time.\n \n \n \n \n\n\n \n Kag, A.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, pages 5189–5200, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Training$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/KagS21,\n  author       = {Anil Kag and\n                  Venkatesh Saligrama},\n  title        = {Training Recurrent Neural Networks via Forward Propagation Through\n                  Time},\n  booktitle    = {Proceedings of the 38th International Conference on Machine Learning,\n                  {ICML} 2021, 18-24 July 2021, Virtual Event},\n  pages        = {5189--5200},\n  year         = {2021},\n  crossref     = {DBLP:conf/icml/2021},\n  url          = {http://proceedings.mlr.press/v139/kag21a.html},\n  timestamp    = {Wed, 25 Aug 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/KagS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Online Selective Classification with Limited Feedback.\n \n \n \n \n\n\n \n Gangrade, A.; Kag, A.; Cutkosky, A.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual, pages 14529–14541, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Online$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/GangradeKCS21,\n  author       = {Aditya Gangrade and\n                  Anil Kag and\n                  Ashok Cutkosky and\n                  Venkatesh Saligrama},\n  title        = {Online Selective Classification with Limited Feedback},\n  booktitle    = {Advances in Neural Information Processing Systems 34: Annual Conference\n                  on Neural Information Processing Systems 2021, NeurIPS 2021, December\n                  6-14, 2021, virtual},\n  pages        = {14529--14541},\n  year         = {2021},\n  crossref     = {DBLP:conf/nips/2021},\n  url          = {https://proceedings.neurips.cc/paper/2021/hash/79b6245ff93841eb8c120cec9bf8be14-Abstract.html},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/nips/GangradeKCS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Bandit Quickest Changepoint Detection.\n \n \n \n \n\n\n \n Gopalan, A.; Lakshminarayanan, B.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual, pages 29064–29073, 2021. \n \n\n\n\n
\n\n\n\n \n \n $\"Bandit$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/GopalanLS21,\n  author       = {Aditya Gopalan and\n                  Braghadeesh Lakshminarayanan and\n                  Venkatesh Saligrama},\n  title        = {Bandit Quickest Changepoint Detection},\n  booktitle    = {Advances in Neural Information Processing Systems 34: Annual Conference\n                  on Neural Information Processing Systems 2021, NeurIPS 2021, December\n                  6-14, 2021, virtual},\n  pages        = {29064--29073},\n  year         = {2021},\n  crossref     = {DBLP:conf/nips/2021},\n  url          = {https://proceedings.neurips.cc/paper/2021/hash/f3a4ff4839c56a5f460c88cce3666a2b-Abstract.html},\n  timestamp    = {Tue, 03 May 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/nips/GopalanLS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Surprisingly Simple Semi-Supervised Domain Adaptation with Pretraining and Consistency.\n \n \n \n \n\n\n \n Mishra, S.; Saenko, K.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2101.12727. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Surprisingly$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2101-12727,\n  author       = {Samarth Mishra and\n                  Kate Saenko and\n                  Venkatesh Saligrama},\n  title        = {Surprisingly Simple Semi-Supervised Domain Adaptation with Pretraining\n                  and Consistency},\n  journal      = {CoRR},\n  volume       = {abs/2101.12727},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2101.12727},\n  eprinttype    = {arXiv},\n  eprint       = {2101.12727},\n  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2101-12727.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Effectively Leveraging Attributes for Visual Similarity.\n \n \n \n \n\n\n \n Mishra, S.; Zhang, Z.; Shen, Y.; Kumar, R.; Saligrama, V.; and Plummer, B. A.\n\n\n \n\n\n\n CoRR, abs/2105.01695. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Effectively$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2105-01695,\n  author       = {Samarth Mishra and\n                  Zhongping Zhang and\n                  Yuan Shen and\n                  Ranjitha Kumar and\n                  Venkatesh Saligrama and\n                  Bryan A. Plummer},\n  title        = {Effectively Leveraging Attributes for Visual Similarity},\n  journal      = {CoRR},\n  volume       = {abs/2105.01695},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2105.01695},\n  eprinttype    = {arXiv},\n  eprint       = {2105.01695},\n  timestamp    = {Wed, 12 May 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2105-01695.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Bandit Quickest Changepoint Detection.\n \n \n \n \n\n\n \n Gopalan, A.; Saligrama, V.; and Lakshminarayanan, B.\n\n\n \n\n\n\n CoRR, abs/2107.10492. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Bandit$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2107-10492,\n  author       = {Aditya Gopalan and\n                  Venkatesh Saligrama and\n                  Braghadeesh Lakshminarayanan},\n  title        = {Bandit Quickest Changepoint Detection},\n  journal      = {CoRR},\n  volume       = {abs/2107.10492},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2107.10492},\n  eprinttype    = {arXiv},\n  eprint       = {2107.10492},\n  timestamp    = {Thu, 29 Jul 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2107-10492.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Online Selective Classification with Limited Feedback.\n \n \n \n \n\n\n \n Gangrade, A.; Kag, A.; Cutkosky, A.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2110.14243. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Online$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2110-14243,\n  author       = {Aditya Gangrade and\n                  Anil Kag and\n                  Ashok Cutkosky and\n                  Venkatesh Saligrama},\n  title        = {Online Selective Classification with Limited Feedback},\n  journal      = {CoRR},\n  volume       = {abs/2110.14243},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2110.14243},\n  eprinttype    = {arXiv},\n  eprint       = {2110.14243},\n  timestamp    = {Fri, 29 Oct 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2110-14243.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Faster Convex Lipschitz Regression via 2-block ADMM.\n \n \n \n \n\n\n \n Siahkamari, A.; Acar, D. A. E.; Liao, C.; Geyer, K.; Saligrama, V.; and Kulis, B.\n\n\n \n\n\n\n CoRR, abs/2111.01348. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Faster$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2111-01348,\n  author       = {Ali Siahkamari and\n                  Durmus Alp Emre Acar and\n                  Christopher Liao and\n                  Kelly Geyer and\n                  Venkatesh Saligrama and\n                  Brian Kulis},\n  title        = {Faster Convex Lipschitz Regression via 2-block {ADMM}},\n  journal      = {CoRR},\n  volume       = {abs/2111.01348},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2111.01348},\n  eprinttype    = {arXiv},\n  eprint       = {2111.01348},\n  timestamp    = {Fri, 05 Nov 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-01348.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Federated Learning Based on Dynamic Regularization.\n \n \n \n \n\n\n \n Acar, D. A. E.; Zhao, Y.; Navarro, R. M.; Mattina, M.; Whatmough, P. N.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2111.04263. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Federated$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2111-04263,\n  author       = {Durmus Alp Emre Acar and\n                  Yue Zhao and\n                  Ramon Matas Navarro and\n                  Matthew Mattina and\n                  Paul N. Whatmough and\n                  Venkatesh Saligrama},\n  title        = {Federated Learning Based on Dynamic Regularization},\n  journal      = {CoRR},\n  volume       = {abs/2111.04263},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2111.04263},\n  eprinttype    = {arXiv},\n  eprint       = {2111.04263},\n  timestamp    = {Wed, 10 Nov 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-04263.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Task2Sim : Towards Effective Pre-training and Transfer from Synthetic Data.\n \n \n \n \n\n\n \n Mishra, S.; Panda, R.; Phoo, C. P.; Chen, C.; Karlinsky, L.; Saenko, K.; Saligrama, V.; and Feris, R. S.\n\n\n \n\n\n\n CoRR, abs/2112.00054. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Task2Sim$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2112-00054,\n  author       = {Samarth Mishra and\n                  Rameswar Panda and\n                  Cheng Perng Phoo and\n                  Chun{-}Fu Chen and\n                  Leonid Karlinsky and\n                  Kate Saenko and\n                  Venkatesh Saligrama and\n                  Rog{\\'{e}}rio Schmidt Feris},\n  title        = {Task2Sim : Towards Effective Pre-training and Transfer from Synthetic\n                  Data},\n  journal      = {CoRR},\n  volume       = {abs/2112.00054},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2112.00054},\n  eprinttype    = {arXiv},\n  eprint       = {2112.00054},\n  timestamp    = {Tue, 07 Dec 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2112-00054.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2020\n \n \n (19)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers.\n \n \n \n \n\n\n \n Ma, Y.; Olshevsky, A.; Szepesvári, C.; and Saligrama, V.\n\n\n \n\n\n\n J. Mach. Learn. Res., 21: 133:1–133:36. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"Gradient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/jmlr/MaOSS20,\n  author       = {Yao Ma and\n                  Alex Olshevsky and\n                  Csaba Szepesv{\\'{a}}ri and\n                  Venkatesh Saligrama},\n  title        = {Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced\n                  Aggregation of Sparsely Interacting Workers},\n  journal      = {J. Mach. Learn. Res.},\n  volume       = {21},\n  pages        = {133:1--133:36},\n  year         = {2020},\n  url          = {http://jmlr.org/papers/v21/19-359.html},\n  timestamp    = {Wed, 18 Nov 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/jmlr/MaOSS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Zero Shot Detection.\n \n \n \n \n\n\n \n Zhu, P.; Wang, H.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Circuits Syst. Video Technol., 30(4): 998–1010. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"Zero$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tcsv/ZhuWS20,\n  author       = {Pengkai Zhu and\n                  Hanxiao Wang and\n                  Venkatesh Saligrama},\n  title        = {Zero Shot Detection},\n  journal      = {{IEEE} Trans. Circuits Syst. Video Technol.},\n  volume       = {30},\n  number       = {4},\n  pages        = {998--1010},\n  year         = {2020},\n  url          = {https://doi.org/10.1109/TCSVT.2019.2899569},\n  doi          = {10.1109/TCSVT.2019.2899569},\n  timestamp    = {Tue, 02 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tcsv/ZhuWS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Minimax Rank-$}1{$ Matrix Factorization.\n \n \n \n \n\n\n \n Saligrama, V.; Olshevsky, A.; and Hendrickx, J. M.\n\n\n \n\n\n\n In The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26-28 August 2020, Online [Palermo, Sicily, Italy], pages 3426–3436, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"Minimax$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/SaligramaOH20,\n  author       = {Venkatesh Saligrama and\n                  Alexander Olshevsky and\n                  Julien M. Hendrickx},\n  title        = {Minimax Rank-{\\textdollar}1{\\textdollar} Matrix Factorization},\n  booktitle    = {The 23rd International Conference on Artificial Intelligence and Statistics,\n                  {AISTATS} 2020, 26-28 August 2020, Online [Palermo, Sicily, Italy]},\n  pages        = {3426--3436},\n  year         = {2020},\n  crossref     = {DBLP:conf/aistats/2020},\n  url          = {http://proceedings.mlr.press/v108/saligrama20a.html},\n  timestamp    = {Mon, 29 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/SaligramaOH20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Budget Learning via Bracketing.\n \n \n \n \n\n\n \n Acar, D. A. E.; Gangrade, A.; and Saligrama, V.\n\n\n \n\n\n\n In The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26-28 August 2020, Online [Palermo, Sicily, Italy], pages 4109–4119, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"Budget$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/AcarGS20,\n  author       = {Durmus Alp Emre Acar and\n                  Aditya Gangrade and\n                  Venkatesh Saligrama},\n  title        = {Budget Learning via Bracketing},\n  booktitle    = {The 23rd International Conference on Artificial Intelligence and Statistics,\n                  {AISTATS} 2020, 26-28 August 2020, Online [Palermo, Sicily, Italy]},\n  pages        = {4109--4119},\n  year         = {2020},\n  crossref     = {DBLP:conf/aistats/2020},\n  url          = {http://proceedings.mlr.press/v108/acar20a.html},\n  timestamp    = {Mon, 29 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/AcarGS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Don't Even Look Once: Synthesizing Features for Zero-Shot Detection.\n \n \n \n \n\n\n \n Zhu, P.; Wang, H.; and Saligrama, V.\n\n\n \n\n\n\n In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2020, Seattle, WA, USA, June 13-19, 2020, pages 11690–11699, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"Don't$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/ZhuWS20,\n  author       = {Pengkai Zhu and\n                  Hanxiao Wang and\n                  Venkatesh Saligrama},\n  title        = {Don't Even Look Once: Synthesizing Features for Zero-Shot Detection},\n  booktitle    = {2020 {IEEE/CVF} Conference on Computer Vision and Pattern Recognition,\n                  {CVPR} 2020, Seattle, WA, USA, June 13-19, 2020},\n  pages        = {11690--11699},\n  year         = {2020},\n  crossref     = {DBLP:conf/cvpr/2020},\n  url          = {https://openaccess.thecvf.com/content\\_CVPR\\_2020/html/Zhu\\_Dont\\_Even\\_Look\\_Once\\_Synthesizing\\_Features\\_for\\_Zero-Shot\\_Detection\\_CVPR\\_2020\\_paper.html},\n  doi          = {10.1109/CVPR42600.2020.01171},\n  timestamp    = {Tue, 02 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/cvpr/ZhuWS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n RNNs Incrementally Evolving on an Equilibrium Manifold: A Panacea for Vanishing and Exploding Gradients?.\n \n \n \n \n\n\n \n Kag, A.; Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n In 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"RNNs$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/iclr/KagZS20,\n  author       = {Anil Kag and\n                  Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {RNNs Incrementally Evolving on an Equilibrium Manifold: {A} Panacea\n                  for Vanishing and Exploding Gradients?},\n  booktitle    = {8th International Conference on Learning Representations, {ICLR} 2020,\n                  Addis Ababa, Ethiopia, April 26-30, 2020},\n  year         = {2020},\n  crossref     = {DBLP:conf/iclr/2020},\n  url          = {https://openreview.net/forum?id=HylpqA4FwS},\n  timestamp    = {Thu, 07 May 2020 17:11:47 +0200},\n  biburl       = {https://dblp.org/rec/conf/iclr/KagZS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Minimax Rate for Learning From Pairwise Comparisons in the BTL Model.\n \n \n \n \n\n\n \n Hendrickx, J. M.; Olshevsky, A.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event, pages 4193–4202, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"Minimax$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/HendrickxOS20,\n  author       = {Julien M. Hendrickx and\n                  Alex Olshevsky and\n                  Venkatesh Saligrama},\n  title        = {Minimax Rate for Learning From Pairwise Comparisons in the {BTL} Model},\n  booktitle    = {Proceedings of the 37th International Conference on Machine Learning,\n                  {ICML} 2020, 13-18 July 2020, Virtual Event},\n  pages        = {4193--4202},\n  year         = {2020},\n  crossref     = {DBLP:conf/icml/2020},\n  url          = {http://proceedings.mlr.press/v119/hendrickx20a.html},\n  timestamp    = {Tue, 15 Dec 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/icml/HendrickxOS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Piecewise Linear Regression via a Difference of Convex Functions.\n \n \n \n \n\n\n \n Siahkamari, A.; Gangrade, A.; Kulis, B.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event, pages 8895–8904, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"Piecewise$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/SiahkamariGKS20,\n  author       = {Ali Siahkamari and\n                  Aditya Gangrade and\n                  Brian Kulis and\n                  Venkatesh Saligrama},\n  title        = {Piecewise Linear Regression via a Difference of Convex Functions},\n  booktitle    = {Proceedings of the 37th International Conference on Machine Learning,\n                  {ICML} 2020, 13-18 July 2020, Virtual Event},\n  pages        = {8895--8904},\n  year         = {2020},\n  crossref     = {DBLP:conf/icml/2020},\n  url          = {http://proceedings.mlr.press/v119/siahkamari20a.html},\n  timestamp    = {Tue, 15 Dec 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/icml/SiahkamariGKS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Low Dimensional Visual Attributes: An Interpretable Image Encoding.\n \n \n \n \n\n\n \n Zhu, P.; Zhu, R.; Mishra, S.; and Saligrama, V.\n\n\n \n\n\n\n In Pattern Recognition. ICPR International Workshops and Challenges - Virtual Event, January 10-15, 2021, Proceedings, Part III, pages 90–102, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"Low$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icpr/ZhuZMS20,\n  author       = {Pengkai Zhu and\n                  Ruizhao Zhu and\n                  Samarth Mishra and\n                  Venkatesh Saligrama},\n  title        = {Low Dimensional Visual Attributes: An Interpretable Image Encoding},\n  booktitle    = {Pattern Recognition. {ICPR} International Workshops and Challenges\n                  - Virtual Event, January 10-15, 2021, Proceedings, Part {III}},\n  pages        = {90--102},\n  year         = {2020},\n  crossref     = {DBLP:conf/icpr/2020w3},\n  url          = {https://doi.org/10.1007/978-3-030-68796-0\\_7},\n  doi          = {10.1007/978-3-030-68796-0\\_7},\n  timestamp    = {Tue, 11 Apr 2023 17:29:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/icpr/ZhuZMS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n RNN Training along Locally Optimal Trajectories via Frank-Wolfe Algorithm.\n \n \n \n \n\n\n \n Yue, Y.; Li, M.; Saligrama, V.; and Zhang, Z.\n\n\n \n\n\n\n In 25th International Conference on Pattern Recognition, ICPR 2020, Virtual Event / Milan, Italy, January 10-15, 2021, pages 10532–10539, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"RNN$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icpr/YueLSZ20,\n  author       = {Yun Yue and\n                  Ming Li and\n                  Venkatesh Saligrama and\n                  Ziming Zhang},\n  title        = {{RNN} Training along Locally Optimal Trajectories via Frank-Wolfe\n                  Algorithm},\n  booktitle    = {25th International Conference on Pattern Recognition, {ICPR} 2020,\n                  Virtual Event / Milan, Italy, January 10-15, 2021},\n  pages        = {10532--10539},\n  year         = {2020},\n  crossref     = {DBLP:conf/icpr/2020},\n  url          = {https://doi.org/10.1109/ICPR48806.2021.9412188},\n  doi          = {10.1109/ICPR48806.2021.9412188},\n  timestamp    = {Fri, 07 May 2021 08:42:33 +0200},\n  biburl       = {https://dblp.org/rec/conf/icpr/YueLSZ20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Limits on Testing Structural Changes in Ising Models.\n \n \n \n \n\n\n \n Gangrade, A.; Nazer, B.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"Limits$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/GangradeNS20,\n  author       = {Aditya Gangrade and\n                  Bobak Nazer and\n                  Venkatesh Saligrama},\n  title        = {Limits on Testing Structural Changes in Ising Models},\n  booktitle    = {Advances in Neural Information Processing Systems 33: Annual Conference\n                  on Neural Information Processing Systems 2020, NeurIPS 2020, December\n                  6-12, 2020, virtual},\n  year         = {2020},\n  crossref     = {DBLP:conf/nips/2020},\n  url          = {https://proceedings.neurips.cc/paper/2020/hash/70431e77d378d760c3c5456519f06efe-Abstract.html},\n  timestamp    = {Tue, 19 Jan 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/nips/GangradeNS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning to Approximate a Bregman Divergence.\n \n \n \n \n\n\n \n Siahkamari, A.; Xia, X.; Saligrama, V.; Castañón, D. A.; and Kulis, B.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/SiahkamariXSCK20,\n  author       = {Ali Siahkamari and\n                  Xide Xia and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n and\n                  Brian Kulis},\n  title        = {Learning to Approximate a Bregman Divergence},\n  booktitle    = {Advances in Neural Information Processing Systems 33: Annual Conference\n                  on Neural Information Processing Systems 2020, NeurIPS 2020, December\n                  6-12, 2020, virtual},\n  year         = {2020},\n  crossref     = {DBLP:conf/nips/2020},\n  url          = {https://proceedings.neurips.cc/paper/2020/hash/24bcb4d0caa4120575bb45c8a156b651-Abstract.html},\n  timestamp    = {Tue, 19 Jan 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/nips/SiahkamariXSCK20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Online Algorithm for Unsupervised Sequential Selection with Contextual Information.\n \n \n \n \n\n\n \n Verma, A.; Hanawal, M. K.; Szepesvári, C.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual, 2020. \n \n\n\n\n
\n\n\n\n \n \n $\"Online$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/VermaHSS20,\n  author       = {Arun Verma and\n                  Manjesh Kumar Hanawal and\n                  Csaba Szepesv{\\'{a}}ri and\n                  Venkatesh Saligrama},\n  title        = {Online Algorithm for Unsupervised Sequential Selection with Contextual\n                  Information},\n  booktitle    = {Advances in Neural Information Processing Systems 33: Annual Conference\n                  on Neural Information Processing Systems 2020, NeurIPS 2020, December\n                  6-12, 2020, virtual},\n  year         = {2020},\n  crossref     = {DBLP:conf/nips/2020},\n  url          = {https://proceedings.neurips.cc/paper/2020/hash/08e5d8066881eab185d0de9db3b36c7f-Abstract.html},\n  timestamp    = {Tue, 19 Jan 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/nips/VermaHSS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Budget Learning via Bracketing.\n \n \n \n \n\n\n \n Gangrade, A.; Acar, D. A. E.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2004.06298. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"Budget$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2004-06298,\n  author       = {Aditya Gangrade and\n                  Durmus Alp Emre Acar and\n                  Venkatesh Saligrama},\n  title        = {Budget Learning via Bracketing},\n  journal      = {CoRR},\n  volume       = {abs/2004.06298},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2004.06298},\n  eprinttype    = {arXiv},\n  eprint       = {2004.06298},\n  timestamp    = {Tue, 21 Apr 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2004-06298.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Piecewise Linear Regression via a Difference of Convex Functions.\n \n \n \n \n\n\n \n Siahkamari, A.; Gangrade, A.; Kulis, B.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2007.02422. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"Piecewise$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2007-02422,\n  author       = {Ali Siahkamari and\n                  Aditya Gangrade and\n                  Brian Kulis and\n                  Venkatesh Saligrama},\n  title        = {Piecewise Linear Regression via a Difference of Convex Functions},\n  journal      = {CoRR},\n  volume       = {abs/2007.02422},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2007.02422},\n  eprinttype    = {arXiv},\n  eprint       = {2007.02422},\n  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2007-02422.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n RNN Training along Locally Optimal Trajectories via Frank-Wolfe Algorithm.\n \n \n \n \n\n\n \n Yue, Y.; Li, M.; Saligrama, V.; and Zhang, Z.\n\n\n \n\n\n\n CoRR, abs/2010.05397. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"RNN$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2010-05397,\n  author       = {Yun Yue and\n                  Ming Li and\n                  Venkatesh Saligrama and\n                  Ziming Zhang},\n  title        = {{RNN} Training along Locally Optimal Trajectories via Frank-Wolfe\n                  Algorithm},\n  journal      = {CoRR},\n  volume       = {abs/2010.05397},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2010.05397},\n  eprinttype    = {arXiv},\n  eprint       = {2010.05397},\n  timestamp    = {Tue, 20 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-05397.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Selective Classification via One-Sided Prediction.\n \n \n \n \n\n\n \n Gangrade, A.; Kag, A.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2010.07853. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"Selective$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2010-07853,\n  author       = {Aditya Gangrade and\n                  Anil Kag and\n                  Venkatesh Saligrama},\n  title        = {Selective Classification via One-Sided Prediction},\n  journal      = {CoRR},\n  volume       = {abs/2010.07853},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2010.07853},\n  eprinttype    = {arXiv},\n  eprint       = {2010.07853},\n  timestamp    = {Wed, 21 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-07853.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Online Algorithm for Unsupervised Sequential Selection with Contextual Information.\n \n \n \n \n\n\n \n Verma, A.; Hanawal, M. K.; Szepesvári, C.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2010.12353. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"Online$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2010-12353,\n  author       = {Arun Verma and\n                  Manjesh Kumar Hanawal and\n                  Csaba Szepesv{\\'{a}}ri and\n                  Venkatesh Saligrama},\n  title        = {Online Algorithm for Unsupervised Sequential Selection with Contextual\n                  Information},\n  journal      = {CoRR},\n  volume       = {abs/2010.12353},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2010.12353},\n  eprinttype    = {arXiv},\n  eprint       = {2010.12353},\n  timestamp    = {Tue, 27 Oct 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-12353.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Limits on Testing Structural Changes in Ising Models.\n \n \n \n \n\n\n \n Gangrade, A.; Nazer, B.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/2011.03678. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"Limits$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2011-03678,\n  author       = {Aditya Gangrade and\n                  Bobak Nazer and\n                  Venkatesh Saligrama},\n  title        = {Limits on Testing Structural Changes in Ising Models},\n  journal      = {CoRR},\n  volume       = {abs/2011.03678},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2011.03678},\n  eprinttype    = {arXiv},\n  eprint       = {2011.03678},\n  timestamp    = {Thu, 12 Nov 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2011-03678.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2019\n \n \n (18)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Probabilistic Semantic Retrieval for Surveillance Videos With Activity Graphs.\n \n \n \n \n\n\n \n Chen, Y.; Wang, J.; Bai, Y.; Castañón, G. D.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Multim., 21(3): 704–716. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Probabilistic$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tmm/ChenWBCS19,\n  author       = {Yuting Chen and\n                  Joseph Wang and\n                  Yannan Bai and\n                  Gregory D. Casta{\\~{n}}{\\'{o}}n and\n                  Venkatesh Saligrama},\n  title        = {Probabilistic Semantic Retrieval for Surveillance Videos With Activity\n                  Graphs},\n  journal      = {{IEEE} Trans. Multim.},\n  volume       = {21},\n  number       = {3},\n  pages        = {704--716},\n  year         = {2019},\n  url          = {https://doi.org/10.1109/TMM.2018.2865860},\n  doi          = {10.1109/TMM.2018.2865860},\n  timestamp    = {Thu, 01 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tmm/ChenWBCS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Cost aware Inference for IoT Devices.\n \n \n \n \n\n\n \n Zhu, P.; Acar, D. A. E.; Feng, N.; Jain, P.; and Saligrama, V.\n\n\n \n\n\n\n In The 22nd International Conference on Artificial Intelligence and Statistics, AISTATS 2019, 16-18 April 2019, Naha, Okinawa, Japan, pages 2770–2779, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Cost$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/ZhuAFJS19,\n  author       = {Pengkai Zhu and\n                  Durmus Alp Emre Acar and\n                  Nan Feng and\n                  Prateek Jain and\n                  Venkatesh Saligrama},\n  title        = {Cost aware Inference for IoT Devices},\n  booktitle    = {The 22nd International Conference on Artificial Intelligence and Statistics,\n                  {AISTATS} 2019, 16-18 April 2019, Naha, Okinawa, Japan},\n  pages        = {2770--2779},\n  year         = {2019},\n  crossref     = {DBLP:conf/aistats/2019},\n  url          = {http://proceedings.mlr.press/v89/zhu19d.html},\n  timestamp    = {Tue, 05 May 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/ZhuAFJS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Online Algorithm for Unsupervised Sensor Selection.\n \n \n \n \n\n\n \n Verma, A.; Hanawal, M. K.; Szepesvári, C.; and Saligrama, V.\n\n\n \n\n\n\n In The 22nd International Conference on Artificial Intelligence and Statistics, AISTATS 2019, 16-18 April 2019, Naha, Okinawa, Japan, pages 3168–3176, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Online$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/VermaHSS19,\n  author       = {Arun Verma and\n                  Manjesh Kumar Hanawal and\n                  Csaba Szepesv{\\'{a}}ri and\n                  Venkatesh Saligrama},\n  title        = {Online Algorithm for Unsupervised Sensor Selection},\n  booktitle    = {The 22nd International Conference on Artificial Intelligence and Statistics,\n                  {AISTATS} 2019, 16-18 April 2019, Naha, Okinawa, Japan},\n  pages        = {3168--3176},\n  year         = {2019},\n  crossref     = {DBLP:conf/aistats/2019},\n  url          = {http://proceedings.mlr.press/v89/verma19a.html},\n  timestamp    = {Fri, 09 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/VermaHSS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Generalized Zero-Shot Recognition Based on Visually Semantic Embedding.\n \n \n \n \n\n\n \n Zhu, P.; Wang, H.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2019, Long Beach, CA, USA, June 16-20, 2019, pages 2995–3003, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Generalized$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/ZhuWS19,\n  author       = {Pengkai Zhu and\n                  Hanxiao Wang and\n                  Venkatesh Saligrama},\n  title        = {Generalized Zero-Shot Recognition Based on Visually Semantic Embedding},\n  booktitle    = {{IEEE} Conference on Computer Vision and Pattern Recognition, {CVPR}\n                  2019, Long Beach, CA, USA, June 16-20, 2019},\n  pages        = {2995--3003},\n  year         = {2019},\n  crossref     = {DBLP:conf/cvpr/2019},\n  url          = {http://openaccess.thecvf.com/content\\_CVPR\\_2019/html/Zhu\\_Generalized\\_Zero-Shot\\_Recognition\\_Based\\_on\\_Visually\\_Semantic\\_Embedding\\_CVPR\\_2019\\_paper.html},\n  doi          = {10.1109/CVPR.2019.00311},\n  timestamp    = {Tue, 02 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/cvpr/ZhuWS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Robust Text Classifier on Test-Time Budgets.\n \n \n \n \n\n\n \n Parvez, M. R.; Bolukbasi, T.; Chang, K.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, EMNLP-IJCNLP 2019, Hong Kong, China, November 3-7, 2019, pages 1167–1172, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Robust$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/emnlp/ParvezBCS19,\n  author       = {Md. Rizwan Parvez and\n                  Tolga Bolukbasi and\n                  Kai{-}Wei Chang and\n                  Venkatesh Saligrama},\n  title        = {Robust Text Classifier on Test-Time Budgets},\n  booktitle    = {Proceedings of the 2019 Conference on Empirical Methods in Natural\n                  Language Processing and the 9th International Joint Conference on\n                  Natural Language Processing, {EMNLP-IJCNLP} 2019, Hong Kong, China,\n                  November 3-7, 2019},\n  pages        = {1167--1172},\n  year         = {2019},\n  crossref     = {DBLP:conf/emnlp/2019-1},\n  url          = {https://doi.org/10.18653/v1/D19-1108},\n  doi          = {10.18653/V1/D19-1108},\n  timestamp    = {Thu, 07 Apr 2022 09:14:07 +0200},\n  biburl       = {https://dblp.org/rec/conf/emnlp/ParvezBCS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Cost-Aware Fine-Grained Recognition for IoTs Based on Sequential Fixations.\n \n \n \n \n\n\n \n Wang, H.; Saligrama, V.; Sclaroff, S.; and Ablavsky, V.\n\n\n \n\n\n\n In 2019 IEEE/CVF International Conference on Computer Vision, ICCV 2019, Seoul, Korea (South), October 27 - November 2, 2019, pages 1252–1261, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Cost-Aware$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/iccv/WangSSA19,\n  author       = {Hanxiao Wang and\n                  Venkatesh Saligrama and\n                  Stan Sclaroff and\n                  Vitaly Ablavsky},\n  title        = {Cost-Aware Fine-Grained Recognition for IoTs Based on Sequential Fixations},\n  booktitle    = {2019 {IEEE/CVF} International Conference on Computer Vision, {ICCV}\n                  2019, Seoul, Korea (South), October 27 - November 2, 2019},\n  pages        = {1252--1261},\n  year         = {2019},\n  crossref     = {DBLP:conf/iccv/2019},\n  url          = {https://doi.org/10.1109/ICCV.2019.00134},\n  doi          = {10.1109/ICCV.2019.00134},\n  timestamp    = {Tue, 02 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iccv/WangSSA19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Graph Resistance and Learning from Pairwise Comparisons.\n \n \n \n \n\n\n \n Hendrickx, J. M.; Olshevsky, A.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA, pages 2702–2711, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Graph$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/HendrickxOS19,\n  author       = {Julien M. Hendrickx and\n                  Alexander Olshevsky and\n                  Venkatesh Saligrama},\n  title        = {Graph Resistance and Learning from Pairwise Comparisons},\n  booktitle    = {Proceedings of the 36th International Conference on Machine Learning,\n                  {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},\n  pages        = {2702--2711},\n  year         = {2019},\n  crossref     = {DBLP:conf/icml/2019},\n  url          = {http://proceedings.mlr.press/v97/hendrickx19a.html},\n  timestamp    = {Tue, 11 Jun 2019 15:37:38 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/HendrickxOS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Classifiers for Target Domain with Limited or No Labels.\n \n \n \n \n\n\n \n Zhu, P.; Wang, H.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA, pages 7643–7653, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/ZhuWS19,\n  author       = {Pengkai Zhu and\n                  Hanxiao Wang and\n                  Venkatesh Saligrama},\n  title        = {Learning Classifiers for Target Domain with Limited or No Labels},\n  booktitle    = {Proceedings of the 36th International Conference on Machine Learning,\n                  {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},\n  pages        = {7643--7653},\n  year         = {2019},\n  crossref     = {DBLP:conf/icml/2019},\n  url          = {http://proceedings.mlr.press/v97/zhu19d.html},\n  timestamp    = {Tue, 02 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/ZhuWS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Near-Optimal Testing of Community Changes in Balanced Stochastic Block Models.\n \n \n \n \n\n\n \n Gangrade, A.; Venkatesh, P.; Nazer, B.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, pages 10364–10375, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/GangradeVNS19,\n  author       = {Aditya Gangrade and\n                  Praveen Venkatesh and\n                  Bobak Nazer and\n                  Venkatesh Saligrama},\n  title        = {Efficient Near-Optimal Testing of Community Changes in Balanced Stochastic\n                  Block Models},\n  booktitle    = {Advances in Neural Information Processing Systems 32: Annual Conference\n                  on Neural Information Processing Systems 2019, NeurIPS 2019, December\n                  8-14, 2019, Vancouver, BC, Canada},\n  pages        = {10364--10375},\n  year         = {2019},\n  crossref     = {DBLP:conf/nips/2019},\n  url          = {https://proceedings.neurips.cc/paper/2019/hash/fb4c835feb0a65cc39739320d7a51c02-Abstract.html},\n  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/nips/GangradeVNS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Shallow RNN: Accurate Time-series Classification on Resource Constrained Devices.\n \n \n \n \n\n\n \n Dennis, D. K.; Acar, D. A. E.; Mandikal, V.; Sadasivan, V. S.; Saligrama, V.; Simhadri, H. V.; and Jain, P.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, pages 12896–12906, 2019. \n \n\n\n\n
\n\n\n\n \n \n $\"Shallow$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/DennisAMSSSJ19,\n  author       = {Don Kurian Dennis and\n                  Durmus Alp Emre Acar and\n                  Vikram Mandikal and\n                  Vinu Sankar Sadasivan and\n                  Venkatesh Saligrama and\n                  Harsha Vardhan Simhadri and\n                  Prateek Jain},\n  title        = {Shallow {RNN:} Accurate Time-series Classification on Resource Constrained\n                  Devices},\n  booktitle    = {Advances in Neural Information Processing Systems 32: Annual Conference\n                  on Neural Information Processing Systems 2019, NeurIPS 2019, December\n                  8-14, 2019, Vancouver, BC, Canada},\n  pages        = {12896--12906},\n  year         = {2019},\n  crossref     = {DBLP:conf/nips/2019},\n  url          = {https://proceedings.neurips.cc/paper/2019/hash/76d7c0780ceb8fbf964c102ebc16d75f-Abstract.html},\n  timestamp    = {Thu, 21 Jan 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/nips/DennisAMSSSJ19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Online Algorithm for Unsupervised Sensor Selection.\n \n \n \n \n\n\n \n Verma, A.; Hanawal, M. K.; Szepesvári, C.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1901.04676. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Online$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1901-04676,\n  author       = {Arun Verma and\n                  Manjesh Kumar Hanawal and\n                  Csaba Szepesv{\\'{a}}ri and\n                  Venkatesh Saligrama},\n  title        = {Online Algorithm for Unsupervised Sensor Selection},\n  journal      = {CoRR},\n  volume       = {abs/1901.04676},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1901.04676},\n  eprinttype    = {arXiv},\n  eprint       = {1901.04676},\n  timestamp    = {Fri, 09 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1901-04676.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning for New Visual Environments with Limited Labels.\n \n \n \n \n\n\n \n Zhu, P.; Wang, H.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1901.09079. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1901-09079,\n  author       = {Pengkai Zhu and\n                  Hanxiao Wang and\n                  Venkatesh Saligrama},\n  title        = {Learning for New Visual Environments with Limited Labels},\n  journal      = {CoRR},\n  volume       = {abs/1901.09079},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1901.09079},\n  eprinttype    = {arXiv},\n  eprint       = {1901.09079},\n  timestamp    = {Wed, 03 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1901-09079.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Graph Resistance and Learning from Pairwise Comparisons.\n \n \n \n \n\n\n \n Hendrickx, J. M.; Olshevsky, A.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1902.00141. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Graph$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1902-00141,\n  author       = {Julien M. Hendrickx and\n                  Alex Olshevsky and\n                  Venkatesh Saligrama},\n  title        = {Graph Resistance and Learning from Pairwise Comparisons},\n  journal      = {CoRR},\n  volume       = {abs/1902.00141},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1902.00141},\n  eprinttype    = {arXiv},\n  eprint       = {1902.00141},\n  timestamp    = {Tue, 21 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1902-00141.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Equilibrated Recurrent Neural Network: Neuronal Time-Delayed Self-Feedback Improves Accuracy and Stability.\n \n \n \n \n\n\n \n Zhang, Z.; Kag, A.; Sullivan, A.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1903.00755. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Equilibrated$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1903-00755,\n  author       = {Ziming Zhang and\n                  Anil Kag and\n                  Alan Sullivan and\n                  Venkatesh Saligrama},\n  title        = {Equilibrated Recurrent Neural Network: Neuronal Time-Delayed Self-Feedback\n                  Improves Accuracy and Stability},\n  journal      = {CoRR},\n  volume       = {abs/1903.00755},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1903.00755},\n  eprinttype    = {arXiv},\n  eprint       = {1903.00755},\n  timestamp    = {Sat, 30 Mar 2019 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1903-00755.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers.\n \n \n \n \n\n\n \n Ma, Y.; Olshevsky, A.; Saligrama, V.; and Szepesvári, C.\n\n\n \n\n\n\n CoRR, abs/1904.11608. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Gradient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1904-11608,\n  author       = {Yao Ma and\n                  Alex Olshevsky and\n                  Venkatesh Saligrama and\n                  Csaba Szepesv{\\'{a}}ri},\n  title        = {Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced\n                  Aggregation of Sparsely Interacting Workers},\n  journal      = {CoRR},\n  volume       = {abs/1904.11608},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1904.11608},\n  eprinttype    = {arXiv},\n  eprint       = {1904.11608},\n  timestamp    = {Thu, 02 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-11608.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Bregman Divergences.\n \n \n \n \n\n\n \n Siahkamari, A.; Saligrama, V.; Castanon, D.; and Kulis, B.\n\n\n \n\n\n\n CoRR, abs/1905.11545. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1905-11545,\n  author       = {Ali Siahkamari and\n                  Venkatesh Saligrama and\n                  David Castanon and\n                  Brian Kulis},\n  title        = {Learning Bregman Divergences},\n  journal      = {CoRR},\n  volume       = {abs/1905.11545},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1905.11545},\n  eprinttype    = {arXiv},\n  eprint       = {1905.11545},\n  timestamp    = {Mon, 03 Jun 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1905-11545.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n RNNs Evolving on an Equilibrium Manifold: A Panacea for Vanishing and Exploding Gradients?.\n \n \n \n \n\n\n \n Kag, A.; Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1908.08574. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"RNNs$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1908-08574,\n  author       = {Anil Kag and\n                  Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {RNNs Evolving on an Equilibrium Manifold: {A} Panacea for Vanishing\n                  and Exploding Gradients?},\n  journal      = {CoRR},\n  volume       = {abs/1908.08574},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1908.08574},\n  eprinttype    = {arXiv},\n  eprint       = {1908.08574},\n  timestamp    = {Thu, 29 Aug 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1908-08574.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Dont Even Look Once: Synthesizing Features for Zero-Shot Detection.\n \n \n \n \n\n\n \n Zhu, P.; Wang, H.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1911.07933. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Dont$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1911-07933,\n  author       = {Pengkai Zhu and\n                  Hanxiao Wang and\n                  Venkatesh Saligrama},\n  title        = {Dont Even Look Once: Synthesizing Features for Zero-Shot Detection},\n  journal      = {CoRR},\n  volume       = {abs/1911.07933},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1911.07933},\n  eprinttype    = {arXiv},\n  eprint       = {1911.07933},\n  timestamp    = {Tue, 02 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1911-07933.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2018\n \n \n (8)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Sequential Optimization for Efficient High-Quality Object Proposal Generation.\n \n \n \n \n\n\n \n Zhang, Z.; Liu, Y.; Chen, X.; Zhu, Y.; Cheng, M.; Saligrama, V.; and Torr, P. H. S.\n\n\n \n\n\n\n IEEE Trans. Pattern Anal. Mach. Intell., 40(5): 1209–1223. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Sequential$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/pami/ZhangLCZCST18,\n  author       = {Ziming Zhang and\n                  Yun Liu and\n                  Xi Chen and\n                  Yanjun Zhu and\n                  Ming{-}Ming Cheng and\n                  Venkatesh Saligrama and\n                  Philip H. S. Torr},\n  title        = {Sequential Optimization for Efficient High-Quality Object Proposal\n                  Generation},\n  journal      = {{IEEE} Trans. Pattern Anal. Mach. Intell.},\n  volume       = {40},\n  number       = {5},\n  pages        = {1209--1223},\n  year         = {2018},\n  url          = {https://doi.org/10.1109/TPAMI.2017.2707492},\n  doi          = {10.1109/TPAMI.2017.2707492},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/pami/ZhangLCZCST18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On the Non-Existence of Unbiased Estimators in Constrained Estimation Problems.\n \n \n \n \n\n\n \n Somekh-Baruch, A.; Leshem, A.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 64(8): 5549–5554. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/Somekh-BaruchLS18,\n  author       = {Anelia Somekh{-}Baruch and\n                  Amir Leshem and\n                  Venkatesh Saligrama},\n  title        = {On the Non-Existence of Unbiased Estimators in Constrained Estimation\n                  Problems},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {64},\n  number       = {8},\n  pages        = {5549--5554},\n  year         = {2018},\n  url          = {https://doi.org/10.1109/TIT.2017.2731845},\n  doi          = {10.1109/TIT.2017.2731845},\n  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/Somekh-BaruchLS18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Two-Sample Testing can be as Hard as Structure Learning in Ising Models: Minimax Lower Bounds.\n \n \n \n \n\n\n \n Gangrade, A.; Nazer, B.; and Saligrama, V.\n\n\n \n\n\n\n In 2018 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2018, Calgary, AB, Canada, April 15-20, 2018, pages 6931–6935, 2018. \n \n\n\n\n
\n\n\n\n \n \n $\"Two-Sample$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/GangradeNS18,\n  author       = {Aditya Gangrade and\n                  Bobak Nazer and\n                  Venkatesh Saligrama},\n  title        = {Two-Sample Testing can be as Hard as Structure Learning in Ising Models:\n                  Minimax Lower Bounds},\n  booktitle    = {2018 {IEEE} International Conference on Acoustics, Speech and Signal\n                  Processing, {ICASSP} 2018, Calgary, AB, Canada, April 15-20, 2018},\n  pages        = {6931--6935},\n  year         = {2018},\n  crossref     = {DBLP:conf/icassp/2018},\n  url          = {https://doi.org/10.1109/ICASSP.2018.8462370},\n  doi          = {10.1109/ICASSP.2018.8462370},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/GangradeNS18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers.\n \n \n \n \n\n\n \n Ma, Y.; Olshevsky, A.; Szepesvári, C.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmässan, Stockholm, Sweden, July 10-15, 2018, pages 3341–3350, 2018. \n \n\n\n\n
\n\n\n\n \n \n $\"Gradient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/MaOSS18,\n  author       = {Yao Ma and\n                  Alexander Olshevsky and\n                  Csaba Szepesv{\\'{a}}ri and\n                  Venkatesh Saligrama},\n  title        = {Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced\n                  Aggregation of Sparsely Interacting Workers},\n  booktitle    = {Proceedings of the 35th International Conference on Machine Learning,\n                  {ICML} 2018, Stockholmsm{\\"{a}}ssan, Stockholm, Sweden, July 10-15,\n                  2018},\n  pages        = {3341--3350},\n  year         = {2018},\n  crossref     = {DBLP:conf/icml/2018},\n  url          = {http://proceedings.mlr.press/v80/ma18b.html},\n  timestamp    = {Wed, 03 Apr 2019 18:17:30 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/MaOSS18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Zero-Shot Detection.\n \n \n \n \n\n\n \n Zhu, P.; Wang, H.; Bolukbasi, T.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1803.07113. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Zero-Shot$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1803-07113,\n  author       = {Pengkai Zhu and\n                  Hanxiao Wang and\n                  Tolga Bolukbasi and\n                  Venkatesh Saligrama},\n  title        = {Zero-Shot Detection},\n  journal      = {CoRR},\n  volume       = {abs/1803.07113},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1803.07113},\n  eprinttype    = {arXiv},\n  eprint       = {1803.07113},\n  timestamp    = {Tue, 02 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1803-07113.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Where to Fixate on Foveated Images.\n \n \n \n \n\n\n \n Wang, H.; Saligrama, V.; Sclaroff, S.; and Ablavsky, V.\n\n\n \n\n\n\n CoRR, abs/1811.06868. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1811-06868,\n  author       = {Hanxiao Wang and\n                  Venkatesh Saligrama and\n                  Stan Sclaroff and\n                  Vitaly Ablavsky},\n  title        = {Learning Where to Fixate on Foveated Images},\n  journal      = {CoRR},\n  volume       = {abs/1811.06868},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1811.06868},\n  eprinttype    = {arXiv},\n  eprint       = {1811.06868},\n  timestamp    = {Wed, 03 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-06868.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Generalized Zero-Shot Recognition based on Visually Semantic Embedding.\n \n \n \n \n\n\n \n Zhu, P.; Wang, H.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1811.07993. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Generalized$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1811-07993,\n  author       = {Pengkai Zhu and\n                  Hanxiao Wang and\n                  Venkatesh Saligrama},\n  title        = {Generalized Zero-Shot Recognition based on Visually Semantic Embedding},\n  journal      = {CoRR},\n  volume       = {abs/1811.07993},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1811.07993},\n  eprinttype    = {arXiv},\n  eprint       = {1811.07993},\n  timestamp    = {Tue, 02 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-07993.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Testing Changes in Communities for the Stochastic Block Model.\n \n \n \n \n\n\n \n Gangrade, A.; Venkatesh, P.; Nazer, B.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1812.00769. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Testing$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1812-00769,\n  author       = {Aditya Gangrade and\n                  Praveen Venkatesh and\n                  Bobak Nazer and\n                  Venkatesh Saligrama},\n  title        = {Testing Changes in Communities for the Stochastic Block Model},\n  journal      = {CoRR},\n  volume       = {abs/1812.00769},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1812.00769},\n  eprinttype    = {arXiv},\n  eprint       = {1812.00769},\n  timestamp    = {Tue, 01 Jan 2019 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1812-00769.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2017\n \n \n (20)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n PRISM: Person Reidentification via Structured Matching.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Circuits Syst. Video Technol., 27(3): 499–512. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"PRISM:$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tcsv/ZhangS17,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {{PRISM:} Person Reidentification via Structured Matching},\n  journal      = {{IEEE} Trans. Circuits Syst. Video Technol.},\n  volume       = {27},\n  number       = {3},\n  pages        = {499--512},\n  year         = {2017},\n  url          = {https://doi.org/10.1109/TCSVT.2016.2596159},\n  doi          = {10.1109/TCSVT.2016.2596159},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tcsv/ZhangS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sparse Signal Processing With Linear and Nonlinear Observations: A Unified Shannon-Theoretic Approach.\n \n \n \n \n\n\n \n Aksoylar, C.; Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 63(2): 749–776. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Sparse$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/AksoylarAS17,\n  author       = {Cem Aksoylar and\n                  George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {Sparse Signal Processing With Linear and Nonlinear Observations: {A}\n                  Unified Shannon-Theoretic Approach},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {63},\n  number       = {2},\n  pages        = {749--776},\n  year         = {2017},\n  url          = {https://doi.org/10.1109/TIT.2016.2605122},\n  doi          = {10.1109/TIT.2016.2605122},\n  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tit/AksoylarAS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Immune-Defectives Graph Through Group Tests.\n \n \n \n \n\n\n \n Ganesan, A.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 63(5): 3010–3028. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/GanesanJS17,\n  author       = {Abhinav Ganesan and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama},\n  title        = {Learning Immune-Defectives Graph Through Group Tests},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {63},\n  number       = {5},\n  pages        = {3010--3028},\n  year         = {2017},\n  url          = {https://doi.org/10.1109/TIT.2016.2647600},\n  doi          = {10.1109/TIT.2016.2647600},\n  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tit/GanesanJS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in \"Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations\".\n \n \n \n \n\n\n \n Nan, F.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 63(11): 7612–7614. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Comments$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/NanS17,\n  author       = {Feng Nan and\n                  Venkatesh Saligrama},\n  title        = {Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive\n                  Submodularity and Its Implications for the Group Identification Problem\n                  in "Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical\n                  Situations"},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {63},\n  number       = {11},\n  pages        = {7612--7614},\n  year         = {2017},\n  url          = {https://doi.org/10.1109/TIT.2017.2749505},\n  doi          = {10.1109/TIT.2017.2749505},\n  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tit/NanS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Clustering and Community Detection With Imbalanced Clusters.\n \n \n \n \n\n\n \n Aksoylar, C.; Qian, J.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Signal Inf. Process. over Networks, 3(1): 61–76. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Clustering$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tsipn/AksoylarQS17,\n  author       = {Cem Aksoylar and\n                  Jing Qian and\n                  Venkatesh Saligrama},\n  title        = {Clustering and Community Detection With Imbalanced Clusters},\n  journal      = {{IEEE} Trans. Signal Inf. Process. over Networks},\n  volume       = {3},\n  number       = {1},\n  pages        = {61--76},\n  year         = {2017},\n  url          = {https://doi.org/10.1109/TSIPN.2016.2601022},\n  doi          = {10.1109/TSIPN.2016.2601022},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tsipn/AksoylarQS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Resource Constrained Structured Prediction.\n \n \n \n \n\n\n \n Bolukbasi, T.; Chang, K.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 1756–1762, 2017. \n \n\n\n\n
\n\n\n\n \n \n $\"Resource$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aaai/BolukbasiCWS17,\n  author       = {Tolga Bolukbasi and\n                  Kai{-}Wei Chang and\n                  Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Resource Constrained Structured Prediction},\n  booktitle    = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,\n                  February 4-9, 2017, San Francisco, California, {USA}},\n  pages        = {1756--1762},\n  year         = {2017},\n  crossref     = {DBLP:conf/aaai/2017},\n  url          = {https://doi.org/10.1609/aaai.v31i1.10917},\n  doi          = {10.1609/AAAI.V31I1.10917},\n  timestamp    = {Mon, 04 Sep 2023 14:40:32 +0200},\n  biburl       = {https://dblp.org/rec/conf/aaai/BolukbasiCWS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Unsupervised Sequential Sensor Acquisition.\n \n \n \n \n\n\n \n Hanawal, M. K.; Szepesvári, C.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017, 20-22 April 2017, Fort Lauderdale, FL, USA, pages 803–811, 2017. \n \n\n\n\n
\n\n\n\n \n \n $\"Unsupervised$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/HanawalSS17,\n  author       = {Manjesh Kumar Hanawal and\n                  Csaba Szepesv{\\'{a}}ri and\n                  Venkatesh Saligrama},\n  title        = {Unsupervised Sequential Sensor Acquisition},\n  booktitle    = {Proceedings of the 20th International Conference on Artificial Intelligence\n                  and Statistics, {AISTATS} 2017, 20-22 April 2017, Fort Lauderdale,\n                  FL, {USA}},\n  pages        = {803--811},\n  year         = {2017},\n  crossref     = {DBLP:conf/aistats/2017},\n  url          = {http://proceedings.mlr.press/v54/hanawal17a.html},\n  timestamp    = {Wed, 29 May 2019 08:41:44 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/HanawalSS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Lower bounds for two-sample structural change detection in ising and Gaussian models.\n \n \n \n \n\n\n \n Gangrade, A.; Nazer, B.; and Saligrama, V.\n\n\n \n\n\n\n In 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, IL, USA, October 3-6, 2017, pages 1016–1025, 2017. \n \n\n\n\n
\n\n\n\n \n \n $\"Lower$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/GangradeNS17,\n  author       = {Aditya Gangrade and\n                  Bobak Nazer and\n                  Venkatesh Saligrama},\n  title        = {Lower bounds for two-sample structural change detection in ising and\n                  Gaussian models},\n  booktitle    = {55th Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2017, Monticello, IL, USA, October 3-6, 2017},\n  pages        = {1016--1025},\n  year         = {2017},\n  crossref     = {DBLP:conf/allerton/2017},\n  url          = {https://doi.org/10.1109/ALLERTON.2017.8262849},\n  doi          = {10.1109/ALLERTON.2017.8262849},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/allerton/GangradeNS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Connected Subgraph Detection with Mirror Descent on SDPs.\n \n \n \n \n\n\n \n Aksoylar, C.; Orecchia, L.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pages 51–59, 2017. \n \n\n\n\n
\n\n\n\n \n \n $\"Connected$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/AksoylarOS17,\n  author       = {Cem Aksoylar and\n                  Lorenzo Orecchia and\n                  Venkatesh Saligrama},\n  title        = {Connected Subgraph Detection with Mirror Descent on SDPs},\n  booktitle    = {Proceedings of the 34th International Conference on Machine Learning,\n                  {ICML} 2017, Sydney, NSW, Australia, 6-11 August 2017},\n  pages        = {51--59},\n  year         = {2017},\n  crossref     = {DBLP:conf/icml/2017},\n  url          = {http://proceedings.mlr.press/v70/aksoylar17a.html},\n  timestamp    = {Wed, 29 May 2019 08:41:45 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/AksoylarOS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Adaptive Neural Networks for Efficient Inference.\n \n \n \n \n\n\n \n Bolukbasi, T.; Wang, J.; Dekel, O.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pages 527–536, 2017. \n \n\n\n\n
\n\n\n\n \n \n $\"Adaptive$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/BolukbasiWDS17,\n  author       = {Tolga Bolukbasi and\n                  Joseph Wang and\n                  Ofer Dekel and\n                  Venkatesh Saligrama},\n  title        = {Adaptive Neural Networks for Efficient Inference},\n  booktitle    = {Proceedings of the 34th International Conference on Machine Learning,\n                  {ICML} 2017, Sydney, NSW, Australia, 6-11 August 2017},\n  pages        = {527--536},\n  year         = {2017},\n  crossref     = {DBLP:conf/icml/2017},\n  url          = {http://proceedings.mlr.press/v70/bolukbasi17a.html},\n  timestamp    = {Wed, 03 Apr 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/BolukbasiWDS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Adaptive Classification for Prediction Under a Budget.\n \n \n \n \n\n\n \n Nan, F.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA, pages 4727–4737, 2017. \n \n\n\n\n
\n\n\n\n \n \n $\"Adaptive$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/NanS17,\n  author       = {Feng Nan and\n                  Venkatesh Saligrama},\n  title        = {Adaptive Classification for Prediction Under a Budget},\n  booktitle    = {Advances in Neural Information Processing Systems 30: Annual Conference\n                  on Neural Information Processing Systems 2017, December 4-9, 2017,\n                  Long Beach, CA, {USA}},\n  pages        = {4727--4737},\n  year         = {2017},\n  crossref     = {DBLP:conf/nips/2017},\n  url          = {https://proceedings.neurips.cc/paper/2017/hash/d9ff90f4000eacd3a6c9cb27f78994cf-Abstract.html},\n  timestamp    = {Thu, 21 Jan 2021 13:58:27 +0100},\n  biburl       = {https://dblp.org/rec/conf/nips/NanS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Adaptive Neural Networks for Fast Test-Time Prediction.\n \n \n \n \n\n\n \n Bolukbasi, T.; Wang, J.; Dekel, O.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1702.07811. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Adaptive$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/BolukbasiWDS17,\n  author       = {Tolga Bolukbasi and\n                  Joseph Wang and\n                  Ofer Dekel and\n                  Venkatesh Saligrama},\n  title        = {Adaptive Neural Networks for Fast Test-Time Prediction},\n  journal      = {CoRR},\n  volume       = {abs/1702.07811},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1702.07811},\n  eprinttype    = {arXiv},\n  eprint       = {1702.07811},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BolukbasiWDS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Field of Groves: An Energy-Efficient Random Forest.\n \n \n \n \n\n\n \n Takhirov, Z.; Wang, J.; Louis, M. S.; Saligrama, V.; and Joshi, A.\n\n\n \n\n\n\n CoRR, abs/1704.02978. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Field$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/TakhirovWLSJ17,\n  author       = {Zafar Takhirov and\n                  Joseph Wang and\n                  Marcia S. Louis and\n                  Venkatesh Saligrama and\n                  Ajay Joshi},\n  title        = {Field of Groves: An Energy-Efficient Random Forest},\n  journal      = {CoRR},\n  volume       = {abs/1704.02978},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1704.02978},\n  eprinttype    = {arXiv},\n  eprint       = {1704.02978},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/TakhirovWLSJ17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Dynamic Model Selection for Prediction Under a Budget.\n \n \n \n \n\n\n \n Nan, F.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1704.07505. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Dynamic$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/NanS17,\n  author       = {Feng Nan and\n                  Venkatesh Saligrama},\n  title        = {Dynamic Model Selection for Prediction Under a Budget},\n  journal      = {CoRR},\n  volume       = {abs/1704.07505},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1704.07505},\n  eprinttype    = {arXiv},\n  eprint       = {1704.07505},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/NanS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Comments on the proof of adaptive submodular function minimization.\n \n \n \n \n\n\n \n Nan, F.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1705.03771. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Comments$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/NanS17a,\n  author       = {Feng Nan and\n                  Venkatesh Saligrama},\n  title        = {Comments on the proof of adaptive submodular function minimization},\n  journal      = {CoRR},\n  volume       = {abs/1705.03771},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1705.03771},\n  eprinttype    = {arXiv},\n  eprint       = {1705.03771},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/NanS17a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Adaptive Classification for Prediction Under a Budget.\n \n \n \n \n\n\n \n Nan, F.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1705.10194. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Adaptive$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/NanS17b,\n  author       = {Feng Nan and\n                  Venkatesh Saligrama},\n  title        = {Adaptive Classification for Prediction Under a Budget},\n  journal      = {CoRR},\n  volume       = {abs/1705.10194},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1705.10194},\n  eprinttype    = {arXiv},\n  eprint       = {1705.10194},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/NanS17b.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sequential Dynamic Decision Making with Deep Neural Nets on a Test-Time Budget.\n \n \n \n \n\n\n \n Zhu, H.; Nan, F.; Paschalidis, I. C.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1705.10924. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Sequential$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhuNPS17,\n  author       = {Henghui Zhu and\n                  Feng Nan and\n                  Ioannis Ch. Paschalidis and\n                  Venkatesh Saligrama},\n  title        = {Sequential Dynamic Decision Making with Deep Neural Nets on a Test-Time\n                  Budget},\n  journal      = {CoRR},\n  volume       = {abs/1705.10924},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1705.10924},\n  eprinttype    = {arXiv},\n  eprint       = {1705.10924},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhuNPS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Crowdsourcing with Sparsely Interacting Workers.\n \n \n \n \n\n\n \n Ma, Y.; Olshevsky, A.; Saligrama, V.; and Szepesvári, C.\n\n\n \n\n\n\n CoRR, abs/1706.06660. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Crowdsourcing$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/MaOSS17,\n  author       = {Yao Ma and\n                  Alex Olshevsky and\n                  Venkatesh Saligrama and\n                  Csaba Szepesv{\\'{a}}ri},\n  title        = {Crowdsourcing with Sparsely Interacting Workers},\n  journal      = {CoRR},\n  volume       = {abs/1706.06660},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1706.06660},\n  eprinttype    = {arXiv},\n  eprint       = {1706.06660},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/MaOSS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Lower Bounds for Two-Sample Structural Change Detection in Ising and Gaussian Models.\n \n \n \n \n\n\n \n Gangrade, A.; Nazer, B.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1710.10366. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Lower$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1710-10366,\n  author       = {Aditya Gangrade and\n                  Bobak Nazer and\n                  Venkatesh Saligrama},\n  title        = {Lower Bounds for Two-Sample Structural Change Detection in Ising and\n                  Gaussian Models},\n  journal      = {CoRR},\n  volume       = {abs/1710.10366},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1710.10366},\n  eprinttype    = {arXiv},\n  eprint       = {1710.10366},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1710-10366.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Probabilistic Semantic Retrieval for Surveillance Videos with Activity Graphs.\n \n \n \n \n\n\n \n Chen, Y.; Wang, J.; Bai, Y.; Castañón, G. D.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1712.06204. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Probabilistic$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1712-06204,\n  author       = {Yuting Chen and\n                  Joseph Wang and\n                  Yannan Bai and\n                  Gregory D. Casta{\\~{n}}{\\'{o}}n and\n                  Venkatesh Saligrama},\n  title        = {Probabilistic Semantic Retrieval for Surveillance Videos with Activity\n                  Graphs},\n  journal      = {CoRR},\n  volume       = {abs/1712.06204},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1712.06204},\n  eprinttype    = {arXiv},\n  eprint       = {1712.06204},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1712-06204.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2016\n \n \n (22)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n A Provably Efficient Algorithm for Separable Topic Discovery.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n IEEE J. Sel. Top. Signal Process., 10(4): 712–725. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/jstsp/DingIS16,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {A Provably Efficient Algorithm for Separable Topic Discovery},\n  journal      = {{IEEE} J. Sel. Top. Signal Process.},\n  volume       = {10},\n  number       = {4},\n  pages        = {712--725},\n  year         = {2016},\n  url          = {https://doi.org/10.1109/JSTSP.2016.2555240},\n  doi          = {10.1109/JSTSP.2016.2555240},\n  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/jstsp/DingIS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Retrieval in Long-Surveillance Videos Using User-Described Motion and Object Attributes.\n \n \n \n \n\n\n \n Castañón, G.; Elgharib, M. A.; Saligrama, V.; and Jodoin, P.\n\n\n \n\n\n\n IEEE Trans. Circuits Syst. Video Technol., 26(12): 2313–2327. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Retrieval$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tcsv/CastanonESJ16,\n  author       = {Greg Casta{\\~{n}}{\\'{o}}n and\n                  Mohamed A. Elgharib and\n                  Venkatesh Saligrama and\n                  Pierre{-}Marc Jodoin},\n  title        = {Retrieval in Long-Surveillance Videos Using User-Described Motion\n                  and Object Attributes},\n  journal      = {{IEEE} Trans. Circuits Syst. Video Technol.},\n  volume       = {26},\n  number       = {12},\n  pages        = {2313--2327},\n  year         = {2016},\n  url          = {https://doi.org/10.1109/TCSVT.2015.2473295},\n  doi          = {10.1109/TCSVT.2015.2473295},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tcsv/CastanonESJ16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Guest Editorial Inference and Learning over Networks.\n \n \n \n \n\n\n \n Matta, V.; Richard, C.; Saligrama, V.; and Sayed, A. H.\n\n\n \n\n\n\n IEEE Trans. Signal Inf. Process. over Networks, 2(4): 423–425. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Guest$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tsipn/MattaRSS16,\n  author       = {Vincenzo Matta and\n                  C{\\'{e}}dric Richard and\n                  Venkatesh Saligrama and\n                  Ali H. Sayed},\n  title        = {Guest Editorial Inference and Learning over Networks},\n  journal      = {{IEEE} Trans. Signal Inf. Process. over Networks},\n  volume       = {2},\n  number       = {4},\n  pages        = {423--425},\n  year         = {2016},\n  url          = {https://doi.org/10.1109/TSIPN.2016.2615526},\n  doi          = {10.1109/TSIPN.2016.2615526},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tsipn/MattaRSS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Minimax Optimal Sparse Signal Recovery With Poisson Statistics.\n \n \n \n \n\n\n \n Rohban, M. H.; Saligrama, V.; and Vaziri, D. M.\n\n\n \n\n\n\n IEEE Trans. Signal Process., 64(13): 3495–3508. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Minimax$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tsp/RohbanSV16,\n  author       = {Mohammad Hossein Rohban and\n                  Venkatesh Saligrama and\n                  Delaram Motamed Vaziri},\n  title        = {Minimax Optimal Sparse Signal Recovery With Poisson Statistics},\n  journal      = {{IEEE} Trans. Signal Process.},\n  volume       = {64},\n  number       = {13},\n  pages        = {3495--3508},\n  year         = {2016},\n  url          = {https://doi.org/10.1109/TSP.2016.2529588},\n  doi          = {10.1109/TSP.2016.2529588},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tsp/RohbanSV16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A multi-resolution approach for discovery and 3-D modeling of archaeological sites using satellite imagery and a UAV-borne camera.\n \n \n \n \n\n\n \n Ding, H.; Cristofalo, E.; Wang, J.; Castañón, D. A.; Montijano, E.; Saligrama, V.; and Schwager, M.\n\n\n \n\n\n\n In 2016 American Control Conference, ACC 2016, Boston, MA, USA, July 6-8, 2016, pages 1359–1365, 2016. \n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/amcc/DingCWCMSS16,\n  author       = {Huanyu Ding and\n                  Eric Cristofalo and\n                  Joseph Wang and\n                  David A. Casta{\\~{n}}{\\'{o}}n and\n                  Eduardo Montijano and\n                  Venkatesh Saligrama and\n                  Mac Schwager},\n  title        = {A multi-resolution approach for discovery and 3-D modeling of archaeological\n                  sites using satellite imagery and a UAV-borne camera},\n  booktitle    = {2016 American Control Conference, {ACC} 2016, Boston, MA, USA, July\n                  6-8, 2016},\n  pages        = {1359--1365},\n  year         = {2016},\n  crossref     = {DBLP:conf/amcc/2016},\n  url          = {https://doi.org/10.1109/ACC.2016.7525107},\n  doi          = {10.1109/ACC.2016.7525107},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/amcc/DingCWCMSS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Training of Very Deep Neural Networks for Supervised Hashing.\n \n \n \n \n\n\n \n Zhang, Z.; Chen, Y.; and Saligrama, V.\n\n\n \n\n\n\n In 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016, pages 1487–1495, 2016. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/ZhangCS16,\n  author       = {Ziming Zhang and\n                  Yuting Chen and\n                  Venkatesh Saligrama},\n  title        = {Efficient Training of Very Deep Neural Networks for Supervised Hashing},\n  booktitle    = {2016 {IEEE} Conference on Computer Vision and Pattern Recognition,\n                  {CVPR} 2016, Las Vegas, NV, USA, June 27-30, 2016},\n  pages        = {1487--1495},\n  year         = {2016},\n  crossref     = {DBLP:conf/cvpr/2016},\n  url          = {https://doi.org/10.1109/CVPR.2016.165},\n  doi          = {10.1109/CVPR.2016.165},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cvpr/ZhangCS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Zero-Shot Learning via Joint Latent Similarity Embedding.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n In 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016, pages 6034–6042, 2016. \n \n\n\n\n
\n\n\n\n \n \n $\"Zero-Shot$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/ZhangS16,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {Zero-Shot Learning via Joint Latent Similarity Embedding},\n  booktitle    = {2016 {IEEE} Conference on Computer Vision and Pattern Recognition,\n                  {CVPR} 2016, Las Vegas, NV, USA, June 27-30, 2016},\n  pages        = {6034--6042},\n  year         = {2016},\n  crossref     = {DBLP:conf/cvpr/2016},\n  url          = {https://doi.org/10.1109/CVPR.2016.649},\n  doi          = {10.1109/CVPR.2016.649},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cvpr/ZhangS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Zero-Shot Recognition via Structured Prediction.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n In Computer Vision - ECCV 2016 - 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part VII, pages 533–548, 2016. \n \n\n\n\n
\n\n\n\n \n \n $\"Zero-Shot$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/eccv/ZhangS16,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {Zero-Shot Recognition via Structured Prediction},\n  booktitle    = {Computer Vision - {ECCV} 2016 - 14th European Conference, Amsterdam,\n                  The Netherlands, October 11-14, 2016, Proceedings, Part {VII}},\n  pages        = {533--548},\n  year         = {2016},\n  crossref     = {DBLP:conf/eccv/2016-7},\n  url          = {https://doi.org/10.1007/978-3-319-46478-7\\_33},\n  doi          = {10.1007/978-3-319-46478-7\\_33},\n  timestamp    = {Wed, 07 Dec 2022 23:10:23 +0100},\n  biburl       = {https://dblp.org/rec/conf/eccv/ZhangS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient algorithms for linear polyhedral bandits.\n \n \n \n \n\n\n \n Hanawal, M. K.; Leshem, A.; and Saligrama, V.\n\n\n \n\n\n\n In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016, Shanghai, China, March 20-25, 2016, pages 4796–4800, 2016. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/HanawalLS16,\n  author       = {Manjesh Kumar Hanawal and\n                  Amir Leshem and\n                  Venkatesh Saligrama},\n  title        = {Efficient algorithms for linear polyhedral bandits},\n  booktitle    = {2016 {IEEE} International Conference on Acoustics, Speech and Signal\n                  Processing, {ICASSP} 2016, Shanghai, China, March 20-25, 2016},\n  pages        = {4796--4800},\n  year         = {2016},\n  crossref     = {DBLP:conf/icassp/2016},\n  url          = {https://doi.org/10.1109/ICASSP.2016.7472588},\n  doi          = {10.1109/ICASSP.2016.7472588},\n  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/HanawalLS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Energy-Efficient Adaptive Classifier Design for Mobile Systems.\n \n \n \n \n\n\n \n Takhirov, Z.; Wang, J.; Saligrama, V.; and Joshi, A.\n\n\n \n\n\n\n In Proceedings of the 2016 International Symposium on Low Power Electronics and Design, ISLPED 2016, San Francisco Airport, CA, USA, August 08 - 10, 2016, pages 52–57, 2016. \n \n\n\n\n
\n\n\n\n \n \n $\"Energy-Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/islped/TakhirovWSJ16,\n  author       = {Zafar Takhirov and\n                  Joseph Wang and\n                  Venkatesh Saligrama and\n                  Ajay Joshi},\n  title        = {Energy-Efficient Adaptive Classifier Design for Mobile Systems},\n  booktitle    = {Proceedings of the 2016 International Symposium on Low Power Electronics\n                  and Design, {ISLPED} 2016, San Francisco Airport, CA, USA, August\n                  08 - 10, 2016},\n  pages        = {52--57},\n  year         = {2016},\n  crossref     = {DBLP:conf/islped/2016},\n  url          = {https://doi.org/10.1145/2934583.2934615},\n  doi          = {10.1145/2934583.2934615},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/islped/TakhirovWSJ16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Pruning Random Forests for Prediction on a Budget.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain, pages 2334–2342, 2016. \n \n\n\n\n
\n\n\n\n \n \n $\"Pruning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/NanWS16,\n  author       = {Feng Nan and\n                  Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Pruning Random Forests for Prediction on a Budget},\n  booktitle    = {Advances in Neural Information Processing Systems 29: Annual Conference\n                  on Neural Information Processing Systems 2016, December 5-10, 2016,\n                  Barcelona, Spain},\n  pages        = {2334--2342},\n  year         = {2016},\n  crossref     = {DBLP:conf/nips/2016},\n  url          = {https://proceedings.neurips.cc/paper/2016/hash/3948ead63a9f2944218de038d8934305-Abstract.html},\n  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/nips/NanWS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Man is to Computer Programmer as Woman is to Homemaker? Debiasing Word Embeddings.\n \n \n \n \n\n\n \n Bolukbasi, T.; Chang, K.; Zou, J. Y.; Saligrama, V.; and Kalai, A. T.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain, pages 4349–4357, 2016. \n \n\n\n\n
\n\n\n\n \n \n $\"Man$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/BolukbasiCZSK16,\n  author       = {Tolga Bolukbasi and\n                  Kai{-}Wei Chang and\n                  James Y. Zou and\n                  Venkatesh Saligrama and\n                  Adam Tauman Kalai},\n  title        = {Man is to Computer Programmer as Woman is to Homemaker? Debiasing\n                  Word Embeddings},\n  booktitle    = {Advances in Neural Information Processing Systems 29: Annual Conference\n                  on Neural Information Processing Systems 2016, December 5-10, 2016,\n                  Barcelona, Spain},\n  pages        = {4349--4357},\n  year         = {2016},\n  crossref     = {DBLP:conf/nips/2016},\n  url          = {https://proceedings.neurips.cc/paper/2016/hash/a486cd07e4ac3d270571622f4f316ec5-Abstract.html},\n  timestamp    = {Thu, 21 Jan 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/nips/BolukbasiCZSK16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Optimally Pruning Decision Tree Ensembles With Feature Cost.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1601.00955. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Optimally$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/NanWS16,\n  author       = {Feng Nan and\n                  Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Optimally Pruning Decision Tree Ensembles With Feature Cost},\n  journal      = {CoRR},\n  volume       = {abs/1601.00955},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1601.00955},\n  eprinttype    = {arXiv},\n  eprint       = {1601.00955},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/NanWS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Minimum Volume Sets and Anomaly Detectors from KNN Graphs.\n \n \n \n \n\n\n \n Root, J.; Saligrama, V.; and Qian, J.\n\n\n \n\n\n\n CoRR, abs/1601.06105. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/RootSQ16,\n  author       = {Jonathan Root and\n                  Venkatesh Saligrama and\n                  Jing Qian},\n  title        = {Learning Minimum Volume Sets and Anomaly Detectors from {KNN} Graphs},\n  journal      = {CoRR},\n  volume       = {abs/1601.06105},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1601.06105},\n  eprinttype    = {arXiv},\n  eprint       = {1601.06105},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/RootSQ16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Structured Prediction with Test-time Budget Constraints.\n \n \n \n \n\n\n \n Bolukbasi, T.; Chang, K.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1602.08761. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Structured$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/BolukbasiCWS16,\n  author       = {Tolga Bolukbasi and\n                  Kai{-}Wei Chang and\n                  Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Structured Prediction with Test-time Budget Constraints},\n  journal      = {CoRR},\n  volume       = {abs/1602.08761},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1602.08761},\n  eprinttype    = {arXiv},\n  eprint       = {1602.08761},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BolukbasiCWS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Pruning Random Forests for Prediction on a Budget.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1606.05060. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Pruning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/NanWS16a,\n  author       = {Feng Nan and\n                  Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Pruning Random Forests for Prediction on a Budget},\n  journal      = {CoRR},\n  volume       = {abs/1606.05060},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1606.05060},\n  eprinttype    = {arXiv},\n  eprint       = {1606.05060},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/NanWS16a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Quantifying and Reducing Stereotypes in Word Embeddings.\n \n \n \n \n\n\n \n Bolukbasi, T.; Chang, K.; Zou, J. Y.; Saligrama, V.; and Kalai, A. T.\n\n\n \n\n\n\n CoRR, abs/1606.06121. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Quantifying$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/BolukbasiCZSK16,\n  author       = {Tolga Bolukbasi and\n                  Kai{-}Wei Chang and\n                  James Y. Zou and\n                  Venkatesh Saligrama and\n                  Adam Tauman Kalai},\n  title        = {Quantifying and Reducing Stereotypes in Word Embeddings},\n  journal      = {CoRR},\n  volume       = {abs/1606.06121},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1606.06121},\n  eprinttype    = {arXiv},\n  eprint       = {1606.06121},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BolukbasiCZSK16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Man is to Computer Programmer as Woman is to Homemaker? Debiasing Word Embeddings.\n \n \n \n \n\n\n \n Bolukbasi, T.; Chang, K.; Zou, J. Y.; Saligrama, V.; and Kalai, A.\n\n\n \n\n\n\n CoRR, abs/1607.06520. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Man$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/BolukbasiCZSK16a,\n  author       = {Tolga Bolukbasi and\n                  Kai{-}Wei Chang and\n                  James Y. Zou and\n                  Venkatesh Saligrama and\n                  Adam Kalai},\n  title        = {Man is to Computer Programmer as Woman is to Homemaker? Debiasing\n                  Word Embeddings},\n  journal      = {CoRR},\n  volume       = {abs/1607.06520},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1607.06520},\n  eprinttype    = {arXiv},\n  eprint       = {1607.06520},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BolukbasiCZSK16a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Clustering and Community Detection with Imbalanced Clusters.\n \n \n \n \n\n\n \n Aksoylar, C.; Qian, J.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1608.07605. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Clustering$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/AksoylarQS16,\n  author       = {Cem Aksoylar and\n                  Jing Qian and\n                  Venkatesh Saligrama},\n  title        = {Clustering and Community Detection with Imbalanced Clusters},\n  journal      = {CoRR},\n  volume       = {abs/1608.07605},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1608.07605},\n  eprinttype    = {arXiv},\n  eprint       = {1608.07605},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/AksoylarQS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On the Non-Existence of Unbiased Estimators in Constrained Estimation Problems.\n \n \n \n \n\n\n \n Somekh-Baruch, A.; Leshem, A.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1609.07415. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/Somekh-BaruchLS16,\n  author       = {Anelia Somekh{-}Baruch and\n                  Amir Leshem and\n                  Venkatesh Saligrama},\n  title        = {On the Non-Existence of Unbiased Estimators in Constrained Estimation\n                  Problems},\n  journal      = {CoRR},\n  volume       = {abs/1609.07415},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1609.07415},\n  eprinttype    = {arXiv},\n  eprint       = {1609.07415},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/Somekh-BaruchLS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sequential Learning without Feedback.\n \n \n \n \n\n\n \n Hanawal, M. K.; Szepesvári, C.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1610.05394. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Sequential$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/HanawalSS16,\n  author       = {Manjesh Kumar Hanawal and\n                  Csaba Szepesv{\\'{a}}ri and\n                  Venkatesh Saligrama},\n  title        = {Sequential Learning without Feedback},\n  journal      = {CoRR},\n  volume       = {abs/1610.05394},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1610.05394},\n  eprinttype    = {arXiv},\n  eprint       = {1610.05394},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/HanawalSS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Joint Feature Adaptation for Zero-Shot Recognition.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1611.07593. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhangS16f,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {Learning Joint Feature Adaptation for Zero-Shot Recognition},\n  journal      = {CoRR},\n  volume       = {abs/1611.07593},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1611.07593},\n  eprinttype    = {arXiv},\n  eprint       = {1611.07593},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhangS16f.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2015\n \n \n (32)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Prediction of hospitalization due to heart diseases by supervised learning methods.\n \n \n \n \n\n\n \n Dai, W.; Brisimi, T. S.; Adams, W. G.; Mela, T.; Saligrama, V.; and Paschalidis, I. C.\n\n\n \n\n\n\n Int. J. Medical Informatics, 84(3): 189–197. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Prediction$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/ijmi/DaiBAMSP15,\n  author       = {Wuyang Dai and\n                  Theodora S. Brisimi and\n                  William G. Adams and\n                  Theofanie Mela and\n                  Venkatesh Saligrama and\n                  Ioannis Ch. Paschalidis},\n  title        = {Prediction of hospitalization due to heart diseases by supervised\n                  learning methods},\n  journal      = {Int. J. Medical Informatics},\n  volume       = {84},\n  number       = {3},\n  pages        = {189--197},\n  year         = {2015},\n  url          = {https://doi.org/10.1016/j.ijmedinf.2014.10.002},\n  doi          = {10.1016/J.IJMEDINF.2014.10.002},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/ijmi/DaiBAMSP15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Correction to \"Boolean Compressed Sensing and Noisy Group Testing\".\n \n \n \n \n\n\n \n Atia, G. K.; Saligrama, V.; and Aksoylar, C.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 61(3): 1507. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Correction$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/AtiaSA15,\n  author       = {George K. Atia and\n                  Venkatesh Saligrama and\n                  Cem Aksoylar},\n  title        = {Correction to "Boolean Compressed Sensing and Noisy Group Testing"},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {61},\n  number       = {3},\n  pages        = {1507},\n  year         = {2015},\n  url          = {https://doi.org/10.1109/TIT.2015.2392116},\n  doi          = {10.1109/TIT.2015.2392116},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/AtiaSA15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Topic Modeling Approach to Ranking.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2015, San Diego, California, USA, May 9-12, 2015, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/DingIS15,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {A Topic Modeling Approach to Ranking},\n  booktitle    = {Proceedings of the Eighteenth International Conference on Artificial\n                  Intelligence and Statistics, {AISTATS} 2015, San Diego, California,\n                  USA, May 9-12, 2015},\n  year         = {2015},\n  crossref     = {DBLP:conf/aistats/2015},\n  url          = {http://proceedings.mlr.press/v38/ding15.html},\n  timestamp    = {Wed, 29 May 2019 08:41:44 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/DingIS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Efficient Anomaly Detectors from K-NN Graphs.\n \n \n \n \n\n\n \n Root, J.; Qian, J.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2015, San Diego, California, USA, May 9-12, 2015, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/RootQS15,\n  author       = {Jonathan Root and\n                  Jing Qian and\n                  Venkatesh Saligrama},\n  title        = {Learning Efficient Anomaly Detectors from {K-NN} Graphs},\n  booktitle    = {Proceedings of the Eighteenth International Conference on Artificial\n                  Intelligence and Statistics, {AISTATS} 2015, San Diego, California,\n                  USA, May 9-12, 2015},\n  year         = {2015},\n  crossref     = {DBLP:conf/aistats/2015},\n  url          = {http://proceedings.mlr.press/v38/root15.html},\n  timestamp    = {Wed, 29 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/RootQS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Cost effective algorithms for spectral bandits.\n \n \n \n \n\n\n \n Hanawal, M. K.; and Saligrama, V.\n\n\n \n\n\n\n In 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, Allerton Park & Retreat Center, Monticello, IL, USA, September 29 - October 2, 2015, pages 1323–1329, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Cost$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/HanawalS15,\n  author       = {Manjesh Kumar Hanawal and\n                  Venkatesh Saligrama},\n  title        = {Cost effective algorithms for spectral bandits},\n  booktitle    = {53rd Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2015, Allerton Park {\\&} Retreat Center, Monticello, IL,\n                  USA, September 29 - October 2, 2015},\n  pages        = {1323--1329},\n  year         = {2015},\n  crossref     = {DBLP:conf/allerton/2015},\n  url          = {https://doi.org/10.1109/ALLERTON.2015.7447161},\n  doi          = {10.1109/ALLERTON.2015.7447161},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/allerton/HanawalS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Rapid: Rapidly accelerated proximal gradient algorithms for convex minimization.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n In 2015 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2015, South Brisbane, Queensland, Australia, April 19-24, 2015, pages 3796–3800, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Rapid:$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/ZhangS15,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {Rapid: Rapidly accelerated proximal gradient algorithms for convex\n                  minimization},\n  booktitle    = {2015 {IEEE} International Conference on Acoustics, Speech and Signal\n                  Processing, {ICASSP} 2015, South Brisbane, Queensland, Australia,\n                  April 19-24, 2015},\n  pages        = {3796--3800},\n  year         = {2015},\n  crossref     = {DBLP:conf/icassp/2015},\n  url          = {https://doi.org/10.1109/ICASSP.2015.7178681},\n  doi          = {10.1109/ICASSP.2015.7178681},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/ZhangS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning shared rankings from mixtures of noisy pairwise comparisons.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In 2015 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2015, South Brisbane, Queensland, Australia, April 19-24, 2015, pages 5446–5450, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/DingIS15,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {Learning shared rankings from mixtures of noisy pairwise comparisons},\n  booktitle    = {2015 {IEEE} International Conference on Acoustics, Speech and Signal\n                  Processing, {ICASSP} 2015, South Brisbane, Queensland, Australia,\n                  April 19-24, 2015},\n  pages        = {5446--5450},\n  year         = {2015},\n  crossref     = {DBLP:conf/icassp/2015},\n  url          = {https://doi.org/10.1109/ICASSP.2015.7179012},\n  doi          = {10.1109/ICASSP.2015.7179012},\n  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/DingIS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient detection and localization on graph structured data.\n \n \n \n \n\n\n \n Hanawal, M. K.; and Saligrama, V.\n\n\n \n\n\n\n In 2015 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2015, South Brisbane, Queensland, Australia, April 19-24, 2015, pages 5590–5594, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/HanawalS15,\n  author       = {Manjesh Kumar Hanawal and\n                  Venkatesh Saligrama},\n  title        = {Efficient detection and localization on graph structured data},\n  booktitle    = {2015 {IEEE} International Conference on Acoustics, Speech and Signal\n                  Processing, {ICASSP} 2015, South Brisbane, Queensland, Australia,\n                  April 19-24, 2015},\n  pages        = {5590--5594},\n  year         = {2015},\n  crossref     = {DBLP:conf/icassp/2015},\n  url          = {https://doi.org/10.1109/ICASSP.2015.7179041},\n  doi          = {10.1109/ICASSP.2015.7179041},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/HanawalS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Group Membership Prediction.\n \n \n \n \n\n\n \n Zhang, Z.; Chen, Y.; and Saligrama, V.\n\n\n \n\n\n\n In 2015 IEEE International Conference on Computer Vision, ICCV 2015, Santiago, Chile, December 7-13, 2015, pages 3916–3924, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Group$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/iccv/ZhangCS15,\n  author       = {Ziming Zhang and\n                  Yuting Chen and\n                  Venkatesh Saligrama},\n  title        = {Group Membership Prediction},\n  booktitle    = {2015 {IEEE} International Conference on Computer Vision, {ICCV} 2015,\n                  Santiago, Chile, December 7-13, 2015},\n  pages        = {3916--3924},\n  year         = {2015},\n  crossref     = {DBLP:conf/iccv/2015},\n  url          = {https://doi.org/10.1109/ICCV.2015.446},\n  doi          = {10.1109/ICCV.2015.446},\n  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/iccv/ZhangCS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Zero-Shot Learning via Semantic Similarity Embedding.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n In 2015 IEEE International Conference on Computer Vision, ICCV 2015, Santiago, Chile, December 7-13, 2015, pages 4166–4174, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Zero-Shot$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/iccv/ZhangS15a,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {Zero-Shot Learning via Semantic Similarity Embedding},\n  booktitle    = {2015 {IEEE} International Conference on Computer Vision, {ICCV} 2015,\n                  Santiago, Chile, December 7-13, 2015},\n  pages        = {4166--4174},\n  year         = {2015},\n  crossref     = {DBLP:conf/iccv/2015},\n  url          = {https://doi.org/10.1109/ICCV.2015.474},\n  doi          = {10.1109/ICCV.2015.474},\n  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/iccv/ZhangS15a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Feature-Budgeted Random Forest.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015, pages 1983–1991, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Feature-Budgeted$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/NanWS15,\n  author       = {Feng Nan and\n                  Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Feature-Budgeted Random Forest},\n  booktitle    = {Proceedings of the 32nd International Conference on Machine Learning,\n                  {ICML} 2015, Lille, France, 6-11 July 2015},\n  pages        = {1983--1991},\n  year         = {2015},\n  crossref     = {DBLP:conf/icml/2015},\n  url          = {http://proceedings.mlr.press/v37/nan15.html},\n  timestamp    = {Wed, 29 May 2019 08:41:45 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/NanWS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Cheap Bandits.\n \n \n \n \n\n\n \n Hanawal, M. K.; Saligrama, V.; Valko, M.; and Munos, R.\n\n\n \n\n\n\n In Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015, pages 2133–2142, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Cheap$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/HanawalSVM15,\n  author       = {Manjesh Kumar Hanawal and\n                  Venkatesh Saligrama and\n                  Michal Valko and\n                  R{\\'{e}}mi Munos},\n  title        = {Cheap Bandits},\n  booktitle    = {Proceedings of the 32nd International Conference on Machine Learning,\n                  {ICML} 2015, Lille, France, 6-11 July 2015},\n  pages        = {2133--2142},\n  year         = {2015},\n  crossref     = {DBLP:conf/icml/2015},\n  url          = {http://proceedings.mlr.press/v37/hanawal15.html},\n  timestamp    = {Wed, 29 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/HanawalSVM15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning immune-defectives graph through group tests.\n \n \n \n \n\n\n \n Ganesan, A.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015, pages 66–70, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/isit/GanesanJS15,\n  author       = {Abhinav Ganesan and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama},\n  title        = {Learning immune-defectives graph through group tests},\n  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2015,\n                  Hong Kong, China, June 14-19, 2015},\n  pages        = {66--70},\n  year         = {2015},\n  crossref     = {DBLP:conf/isit/2015},\n  url          = {https://doi.org/10.1109/ISIT.2015.7282418},\n  doi          = {10.1109/ISIT.2015.7282418},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/isit/GanesanJS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Most large topic models are approximately separable.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In 2015 Information Theory and Applications Workshop, ITA 2015, San Diego, CA, USA, February 1-6, 2015, pages 199–203, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Most$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ita/DingIS15,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {Most large topic models are approximately separable},\n  booktitle    = {2015 Information Theory and Applications Workshop, {ITA} 2015, San\n                  Diego, CA, USA, February 1-6, 2015},\n  pages        = {199--203},\n  year         = {2015},\n  crossref     = {DBLP:conf/ita/2015},\n  url          = {https://doi.org/10.1109/ITA.2015.7308989},\n  doi          = {10.1109/ITA.2015.7308989},\n  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ita/DingIS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Non-adaptive group testing with inhibitors.\n \n \n \n \n\n\n \n Ganesan, A.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n In 2015 IEEE Information Theory Workshop, ITW 2015, Jerusalem, Israel, April 26 - May 1, 2015, pages 1–5, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Non-adaptive$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/itw/GanesanJS15,\n  author       = {Abhinav Ganesan and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama},\n  title        = {Non-adaptive group testing with inhibitors},\n  booktitle    = {2015 {IEEE} Information Theory Workshop, {ITW} 2015, Jerusalem, Israel,\n                  April 26 - May 1, 2015},\n  pages        = {1--5},\n  year         = {2015},\n  crossref     = {DBLP:conf/itw/2015},\n  url          = {https://doi.org/10.1109/ITW.2015.7133108},\n  doi          = {10.1109/ITW.2015.7133108},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/itw/GanesanJS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Activity Retrieval through Semantic Graph Queries.\n \n \n \n \n\n\n \n Castañón, G. D.; Chen, Y.; Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 23rd Annual ACM Conference on Multimedia Conference, MM '15, Brisbane, Australia, October 26 - 30, 2015, pages 391–400, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/mm/CastanonCZS15,\n  author       = {Gregory D. Casta{\\~{n}}{\\'{o}}n and\n                  Yuting Chen and\n                  Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {Efficient Activity Retrieval through Semantic Graph Queries},\n  booktitle    = {Proceedings of the 23rd Annual {ACM} Conference on Multimedia Conference,\n                  {MM} '15, Brisbane, Australia, October 26 - 30, 2015},\n  pages        = {391--400},\n  year         = {2015},\n  crossref     = {DBLP:conf/mm/2015},\n  url          = {https://doi.org/10.1145/2733373.2806229},\n  doi          = {10.1145/2733373.2806229},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/mm/CastanonCZS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Learning by Directed Acyclic Graph For Resource Constrained Prediction.\n \n \n \n \n\n\n \n Wang, J.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canada, pages 2152–2160, 2015. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/WangTS15,\n  author       = {Joseph Wang and\n                  Kirill Trapeznikov and\n                  Venkatesh Saligrama},\n  title        = {Efficient Learning by Directed Acyclic Graph For Resource Constrained\n                  Prediction},\n  booktitle    = {Advances in Neural Information Processing Systems 28: Annual Conference\n                  on Neural Information Processing Systems 2015, December 7-12, 2015,\n                  Montreal, Quebec, Canada},\n  pages        = {2152--2160},\n  year         = {2015},\n  crossref     = {DBLP:conf/nips/2015},\n  url          = {https://proceedings.neurips.cc/paper/2015/hash/c0a271bc0ecb776a094786474322cb82-Abstract.html},\n  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/nips/WangTS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Max-Cost Discrete Function Evaluation Problem under a Budget.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1501.02702. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Max-Cost$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/NanWS15,\n  author       = {Feng Nan and\n                  Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Max-Cost Discrete Function Evaluation Problem under a Budget},\n  journal      = {CoRR},\n  volume       = {abs/1501.02702},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1501.02702},\n  eprinttype    = {arXiv},\n  eprint       = {1501.02702},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/NanWS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Efficient Anomaly Detectors from K-NN Graphs.\n \n \n \n \n\n\n \n Qian, J.; Root, J.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1502.01783. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/QianRS15,\n  author       = {Jing Qian and\n                  Jonathan Root and\n                  Venkatesh Saligrama},\n  title        = {Learning Efficient Anomaly Detectors from {K-NN} Graphs},\n  journal      = {CoRR},\n  volume       = {abs/1502.01783},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1502.01783},\n  eprinttype    = {arXiv},\n  eprint       = {1502.01783},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/QianRS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Feature-Budgeted Random Forest.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1502.05925. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Feature-Budgeted$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/NanWS15a,\n  author       = {Feng Nan and\n                  Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Feature-Budgeted Random Forest},\n  journal      = {CoRR},\n  volume       = {abs/1502.05925},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1502.05925},\n  eprinttype    = {arXiv},\n  eprint       = {1502.05925},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/NanWS15a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Immune-Defectives Graph through Group Tests.\n \n \n \n \n\n\n \n Ganesan, A.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1503.00555. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/GanesanJS15,\n  author       = {Abhinav Ganesan and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama},\n  title        = {Learning Immune-Defectives Graph through Group Tests},\n  journal      = {CoRR},\n  volume       = {abs/1503.00555},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1503.00555},\n  eprinttype    = {arXiv},\n  eprint       = {1503.00555},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/GanesanJS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Learning Mixed Membership Mallows Models from Pairwise Comparisons.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1504.00757. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Learning$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/DingIS15,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {Learning Mixed Membership Mallows Models from Pairwise Comparisons},\n  journal      = {CoRR},\n  volume       = {abs/1504.00757},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1504.00757},\n  eprinttype    = {arXiv},\n  eprint       = {1504.00757},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/DingIS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Cheap Bandits.\n \n \n \n \n\n\n \n Hanawal, M. K.; Saligrama, V.; Valko, M.; and Munos, R.\n\n\n \n\n\n\n CoRR, abs/1506.04782. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Cheap$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/HanawalSVM15,\n  author       = {Manjesh Kumar Hanawal and\n                  Venkatesh Saligrama and\n                  Michal Valko and\n                  R{\\'{e}}mi Munos},\n  title        = {Cheap Bandits},\n  journal      = {CoRR},\n  volume       = {abs/1506.04782},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1506.04782},\n  eprinttype    = {arXiv},\n  eprint       = {1506.04782},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/HanawalSVM15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Necessary and Sufficient Conditions and a Provably Efficient Algorithm for Separable Topic Discovery.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1508.05565. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Necessary$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/DingIS15a,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {Necessary and Sufficient Conditions and a Provably Efficient Algorithm\n                  for Separable Topic Discovery},\n  journal      = {CoRR},\n  volume       = {abs/1508.05565},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1508.05565},\n  eprinttype    = {arXiv},\n  eprint       = {1508.05565},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/DingIS15a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sensor Selection by Linear Programming.\n \n \n \n \n\n\n \n Wang, J.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1509.02954. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Sensor$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/WangTS15,\n  author       = {Joseph Wang and\n                  Kirill Trapeznikov and\n                  Venkatesh Saligrama},\n  title        = {Sensor Selection by Linear Programming},\n  journal      = {CoRR},\n  volume       = {abs/1509.02954},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1509.02954},\n  eprinttype    = {arXiv},\n  eprint       = {1509.02954},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/WangTS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Zero-Shot Learning via Semantic Similarity Embedding.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1509.04767. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Zero-Shot$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhangS15d,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {Zero-Shot Learning via Semantic Similarity Embedding},\n  journal      = {CoRR},\n  volume       = {abs/1509.04767},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1509.04767},\n  eprinttype    = {arXiv},\n  eprint       = {1509.04767},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhangS15d.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Group Membership Prediction.\n \n \n \n \n\n\n \n Zhang, Z.; Chen, Y.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1509.04783. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Group$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhangCS15,\n  author       = {Ziming Zhang and\n                  Yuting Chen and\n                  Venkatesh Saligrama},\n  title        = {Group Membership Prediction},\n  journal      = {CoRR},\n  volume       = {abs/1509.04783},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1509.04783},\n  eprinttype    = {arXiv},\n  eprint       = {1509.04783},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhangCS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Algorithms for Linear Bandits on Polyhedral Sets.\n \n \n \n \n\n\n \n Hanawal, M. K.; Leshem, A.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1509.07927. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Algorithms$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/HanawalLS15,\n  author       = {Manjesh Kumar Hanawal and\n                  Amir Leshem and\n                  Venkatesh Saligrama},\n  title        = {Algorithms for Linear Bandits on Polyhedral Sets},\n  journal      = {CoRR},\n  volume       = {abs/1509.07927},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1509.07927},\n  eprinttype    = {arXiv},\n  eprint       = {1509.07927},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/HanawalLS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Learning by Directed Acyclic Graph For Resource Constrained Prediction.\n \n \n \n \n\n\n \n Wang, J.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1510.07609. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/WangTS15a,\n  author       = {Joseph Wang and\n                  Kirill Trapeznikov and\n                  Venkatesh Saligrama},\n  title        = {Efficient Learning by Directed Acyclic Graph For Resource Constrained\n                  Prediction},\n  journal      = {CoRR},\n  volume       = {abs/1510.07609},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1510.07609},\n  eprinttype    = {arXiv},\n  eprint       = {1510.07609},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/WangTS15a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n BING++: A Fast High Quality Object Proposal Generator at 100fps.\n \n \n \n \n\n\n \n Zhang, Z.; Liu, Y.; Bolukbasi, T.; Cheng, M.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1511.04511. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"BING++:$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhangLBCS15,\n  author       = {Ziming Zhang and\n                  Yun Liu and\n                  Tolga Bolukbasi and\n                  Ming{-}Ming Cheng and\n                  Venkatesh Saligrama},\n  title        = {{BING++:} {A} Fast High Quality Object Proposal Generator at 100fps},\n  journal      = {CoRR},\n  volume       = {abs/1511.04511},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1511.04511},\n  eprinttype    = {arXiv},\n  eprint       = {1511.04511},\n  timestamp    = {Wed, 18 Dec 2019 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhangLBCS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Classifying Unseen Instances by Learning Class-Independent Similarity Functions.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1511.04512. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Classifying$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhangS15e,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {Classifying Unseen Instances by Learning Class-Independent Similarity\n                  Functions},\n  journal      = {CoRR},\n  volume       = {abs/1511.04512},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1511.04512},\n  eprinttype    = {arXiv},\n  eprint       = {1511.04512},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhangS15e.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Supervised Hashing with Deep Neural Networks.\n \n \n \n \n\n\n \n Zhang, Z.; Chen, Y.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1511.04524. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Supervised$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhangCS15a,\n  author       = {Ziming Zhang and\n                  Yuting Chen and\n                  Venkatesh Saligrama},\n  title        = {Supervised Hashing with Deep Neural Networks},\n  journal      = {CoRR},\n  volume       = {abs/1511.04524},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1511.04524},\n  eprinttype    = {arXiv},\n  eprint       = {1511.04524},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhangCS15a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2014\n \n \n (22)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms.\n \n \n \n \n\n\n \n Chan, C. L.; Jaggi, S.; Saligrama, V.; and Agnihotri, S.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 60(5): 3019–3035. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"Non-Adaptive$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/ChanJSA14,\n  author       = {Chun Lam Chan and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama and\n                  Samar Agnihotri},\n  title        = {Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {60},\n  number       = {5},\n  pages        = {3019--3035},\n  year         = {2014},\n  url          = {https://doi.org/10.1109/TIT.2014.2310477},\n  doi          = {10.1109/TIT.2014.2310477},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/ChanJSA14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Information-Theoretic Characterization of Sparse Recovery.\n \n \n \n \n\n\n \n Aksoylar, C.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, AISTATS 2014, Reykjavik, Iceland, April 22-25, 2014, pages 38–46, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Information-Theoretic$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/AksoylarS14,\n  author       = {Cem Aksoylar and\n                  Venkatesh Saligrama},\n  title        = {Information-Theoretic Characterization of Sparse Recovery},\n  booktitle    = {Proceedings of the Seventeenth International Conference on Artificial\n                  Intelligence and Statistics, {AISTATS} 2014, Reykjavik, Iceland, April\n                  22-25, 2014},\n  pages        = {38--46},\n  year         = {2014},\n  crossref     = {DBLP:conf/aistats/2014},\n  url          = {http://proceedings.mlr.press/v33/aksoylar14.html},\n  timestamp    = {Wed, 29 May 2019 08:41:44 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/AksoylarS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Distributed Topic Modeling with Provable Guarantees.\n \n \n \n \n\n\n \n Ding, W.; Rohban, M. H.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, AISTATS 2014, Reykjavik, Iceland, April 22-25, 2014, pages 167–175, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/DingRIS14,\n  author       = {Weicong Ding and\n                  Mohammad H. Rohban and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {Efficient Distributed Topic Modeling with Provable Guarantees},\n  booktitle    = {Proceedings of the Seventeenth International Conference on Artificial\n                  Intelligence and Statistics, {AISTATS} 2014, Reykjavik, Iceland, April\n                  22-25, 2014},\n  pages        = {167--175},\n  year         = {2014},\n  crossref     = {DBLP:conf/aistats/2014},\n  url          = {http://proceedings.mlr.press/v33/ding14a.html},\n  timestamp    = {Wed, 29 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/DingRIS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Connected Sub-graph Detection.\n \n \n \n \n\n\n \n Qian, J.; Saligrama, V.; and Chen, Y.\n\n\n \n\n\n\n In Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, AISTATS 2014, Reykjavik, Iceland, April 22-25, 2014, pages 796–804, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Connected$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/QianSC14,\n  author       = {Jing Qian and\n                  Venkatesh Saligrama and\n                  Yuting Chen},\n  title        = {Connected Sub-graph Detection},\n  booktitle    = {Proceedings of the Seventeenth International Conference on Artificial\n                  Intelligence and Statistics, {AISTATS} 2014, Reykjavik, Iceland, April\n                  22-25, 2014},\n  pages        = {796--804},\n  year         = {2014},\n  crossref     = {DBLP:conf/aistats/2014},\n  url          = {http://proceedings.mlr.press/v33/qian14.html},\n  timestamp    = {Wed, 29 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/QianSC14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n An LP for Sequential Learning Under Budgets.\n \n \n \n \n\n\n \n Wang, J.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, AISTATS 2014, Reykjavik, Iceland, April 22-25, 2014, pages 987–995, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"An$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/WangTS14,\n  author       = {Joseph Wang and\n                  Kirill Trapeznikov and\n                  Venkatesh Saligrama},\n  title        = {An {LP} for Sequential Learning Under Budgets},\n  booktitle    = {Proceedings of the Seventeenth International Conference on Artificial\n                  Intelligence and Statistics, {AISTATS} 2014, Reykjavik, Iceland, April\n                  22-25, 2014},\n  pages        = {987--995},\n  year         = {2014},\n  crossref     = {DBLP:conf/aistats/2014},\n  url          = {http://proceedings.mlr.press/v33/wang14b.html},\n  timestamp    = {Wed, 29 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/WangTS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Novel Visual Word Co-occurrence Model for Person Re-identification.\n \n \n \n \n\n\n \n Zhang, Z.; Chen, Y.; and Saligrama, V.\n\n\n \n\n\n\n In Computer Vision - ECCV 2014 Workshops - Zurich, Switzerland, September 6-7 and 12, 2014, Proceedings, Part III, pages 122–133, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/eccv/ZhangCS14,\n  author       = {Ziming Zhang and\n                  Yuting Chen and\n                  Venkatesh Saligrama},\n  title        = {A Novel Visual Word Co-occurrence Model for Person Re-identification},\n  booktitle    = {Computer Vision - {ECCV} 2014 Workshops - Zurich, Switzerland, September\n                  6-7 and 12, 2014, Proceedings, Part {III}},\n  pages        = {122--133},\n  year         = {2014},\n  crossref     = {DBLP:conf/eccv/2014w3},\n  url          = {https://doi.org/10.1007/978-3-319-16199-0\\_9},\n  doi          = {10.1007/978-3-319-16199-0\\_9},\n  timestamp    = {Thu, 27 Jul 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/eccv/ZhangCS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Model Selection by Linear Programming.\n \n \n \n \n\n\n \n Wang, J.; Bolukbasi, T.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n In Computer Vision - ECCV 2014 - 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part II, pages 647–662, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Model$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/eccv/WangBTS14,\n  author       = {Joseph Wang and\n                  Tolga Bolukbasi and\n                  Kirill Trapeznikov and\n                  Venkatesh Saligrama},\n  title        = {Model Selection by Linear Programming},\n  booktitle    = {Computer Vision - {ECCV} 2014 - 13th European Conference, Zurich,\n                  Switzerland, September 6-12, 2014, Proceedings, Part {II}},\n  pages        = {647--662},\n  year         = {2014},\n  crossref     = {DBLP:conf/eccv/2014-2},\n  url          = {https://doi.org/10.1007/978-3-319-10605-2\\_42},\n  doi          = {10.1007/978-3-319-10605-2\\_42},\n  timestamp    = {Sat, 30 Sep 2023 09:39:19 +0200},\n  biburl       = {https://dblp.org/rec/conf/eccv/WangBTS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sensing-aware kernel SVM.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; Saligrama, V.; and Karl, W. C.\n\n\n \n\n\n\n In IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2014, Florence, Italy, May 4-9, 2014, pages 2947–2951, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Sensing-aware$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/DingISK14,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama and\n                  W. Clem Karl},\n  title        = {Sensing-aware kernel {SVM}},\n  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,\n                  {ICASSP} 2014, Florence, Italy, May 4-9, 2014},\n  pages        = {2947--2951},\n  year         = {2014},\n  crossref     = {DBLP:conf/icassp/2014},\n  url          = {https://doi.org/10.1109/ICASSP.2014.6854140},\n  doi          = {10.1109/ICASSP.2014.6854140},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/DingISK14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Fast margin-based cost-sensitive classification.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2014, Florence, Italy, May 4-9, 2014, pages 2952–2956, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Fast$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/NanWTS14,\n  author       = {Feng Nan and\n                  Joseph Wang and\n                  Kirill Trapeznikov and\n                  Venkatesh Saligrama},\n  title        = {Fast margin-based cost-sensitive classification},\n  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,\n                  {ICASSP} 2014, Florence, Italy, May 4-9, 2014},\n  pages        = {2952--2956},\n  year         = {2014},\n  crossref     = {DBLP:conf/icassp/2014},\n  url          = {https://doi.org/10.1109/ICASSP.2014.6854141},\n  doi          = {10.1109/ICASSP.2014.6854141},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/NanWTS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Spectral clustering with imbalanced data.\n \n \n \n \n\n\n \n Qian, J.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2014, Florence, Italy, May 4-9, 2014, pages 3057–3061, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Spectral$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/QianS14,\n  author       = {Jing Qian and\n                  Venkatesh Saligrama},\n  title        = {Spectral clustering with imbalanced data},\n  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,\n                  {ICASSP} 2014, Florence, Italy, May 4-9, 2014},\n  pages        = {3057--3061},\n  year         = {2014},\n  crossref     = {DBLP:conf/icassp/2014},\n  url          = {https://doi.org/10.1109/ICASSP.2014.6854162},\n  doi          = {10.1109/ICASSP.2014.6854162},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/QianS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Anomalous cluster detection.\n \n \n \n \n\n\n \n Qian, J.; Saligrama, V.; and Chen, Y.\n\n\n \n\n\n\n In IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2014, Florence, Italy, May 4-9, 2014, pages 3854–3858, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Anomalous$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/QianSC14,\n  author       = {Jing Qian and\n                  Venkatesh Saligrama and\n                  Yuting Chen},\n  title        = {Anomalous cluster detection},\n  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,\n                  {ICASSP} 2014, Florence, Italy, May 4-9, 2014},\n  pages        = {3854--3858},\n  year         = {2014},\n  crossref     = {DBLP:conf/icassp/2014},\n  url          = {https://doi.org/10.1109/ICASSP.2014.6854323},\n  doi          = {10.1109/ICASSP.2014.6854323},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/QianSC14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sparse signal recovery under poisson statistics for online marketing applications.\n \n \n \n \n\n\n \n Motamedvaziri, D.; Rohban, M. H.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2014, Florence, Italy, May 4-9, 2014, pages 4953–4957, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Sparse$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/MotamedvaziriRS14,\n  author       = {Delaram Motamedvaziri and\n                  Mohammad Hossein Rohban and\n                  Venkatesh Saligrama},\n  title        = {Sparse signal recovery under poisson statistics for online marketing\n                  applications},\n  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,\n                  {ICASSP} 2014, Florence, Italy, May 4-9, 2014},\n  pages        = {4953--4957},\n  year         = {2014},\n  crossref     = {DBLP:conf/icassp/2014},\n  url          = {https://doi.org/10.1109/ICASSP.2014.6854544},\n  doi          = {10.1109/ICASSP.2014.6854544},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/MotamedvaziriRS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Information-theoretic bounds for adaptive sparse recovery.\n \n \n \n \n\n\n \n Aksoylar, C.; and Saligrama, V.\n\n\n \n\n\n\n In 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014, pages 1311–1315, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Information-theoretic$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/isit/AksoylarS14,\n  author       = {Cem Aksoylar and\n                  Venkatesh Saligrama},\n  title        = {Information-theoretic bounds for adaptive sparse recovery},\n  booktitle    = {2014 {IEEE} International Symposium on Information Theory, Honolulu,\n                  HI, USA, June 29 - July 4, 2014},\n  pages        = {1311--1315},\n  year         = {2014},\n  crossref     = {DBLP:conf/isit/2014},\n  url          = {https://doi.org/10.1109/ISIT.2014.6875045},\n  doi          = {10.1109/ISIT.2014.6875045},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/isit/AksoylarS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Minimax Signal Detection on Graphs.\n \n \n \n \n\n\n \n Qian, J.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, December 8-13 2014, Montreal, Quebec, Canada, pages 2708–2716, 2014. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/QianS14,\n  author       = {Jing Qian and\n                  Venkatesh Saligrama},\n  title        = {Efficient Minimax Signal Detection on Graphs},\n  booktitle    = {Advances in Neural Information Processing Systems 27: Annual Conference\n                  on Neural Information Processing Systems 2014, December 8-13 2014,\n                  Montreal, Quebec, Canada},\n  pages        = {2708--2716},\n  year         = {2014},\n  crossref     = {DBLP:conf/nips/2014},\n  url          = {https://proceedings.neurips.cc/paper/2014/hash/28fc2782ea7ef51c1104ccf7b9bea13d-Abstract.html},\n  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/nips/QianS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Information-Theoretic Bounds for Adaptive Sparse Recovery.\n \n \n \n \n\n\n \n Aksoylar, C.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1402.5731. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"Information-Theoretic$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/AksoylarS14,\n  author       = {Cem Aksoylar and\n                  Venkatesh Saligrama},\n  title        = {Information-Theoretic Bounds for Adaptive Sparse Recovery},\n  journal      = {CoRR},\n  volume       = {abs/1402.5731},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1402.5731},\n  eprinttype    = {arXiv},\n  eprint       = {1402.5731},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/AksoylarS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sparse Recovery with Linear and Nonlinear Observations: Dependent and Noisy Data.\n \n \n \n \n\n\n \n Aksoylar, C.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1403.3109. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"Sparse$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/AksoylarS14a,\n  author       = {Cem Aksoylar and\n                  Venkatesh Saligrama},\n  title        = {Sparse Recovery with Linear and Nonlinear Observations: Dependent\n                  and Noisy Data},\n  journal      = {CoRR},\n  volume       = {abs/1403.3109},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1403.3109},\n  eprinttype    = {arXiv},\n  eprint       = {1403.3109},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/AksoylarS14a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Retrieval in Long Surveillance Videos using User Described Motion and Object Attributes.\n \n \n \n \n\n\n \n Castañón, G.; Elgharib, M. A.; Saligrama, V.; and Jodoin, P.\n\n\n \n\n\n\n CoRR, abs/1405.0234. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"Retrieval$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/CastanonESJ14,\n  author       = {Greg Casta{\\~{n}}{\\'{o}}n and\n                  Mohamed A. Elgharib and\n                  Venkatesh Saligrama and\n                  Pierre{-}Marc Jodoin},\n  title        = {Retrieval in Long Surveillance Videos using User Described Motion\n                  and Object Attributes},\n  journal      = {CoRR},\n  volume       = {abs/1405.0234},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1405.0234},\n  eprinttype    = {arXiv},\n  eprint       = {1405.0234},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/CastanonESJ14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Person Re-identification via Structured Prediction.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1406.4444. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"Person$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhangS14a,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {Person Re-identification via Structured Prediction},\n  journal      = {CoRR},\n  volume       = {abs/1406.4444},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1406.4444},\n  eprinttype    = {arXiv},\n  eprint       = {1406.4444},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhangS14a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n RAPID: Rapidly Accelerated Proximal Gradient Algorithms for Convex Minimization.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1406.4445. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"RAPID:$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhangS14c,\n  author       = {Ziming Zhang and\n                  Venkatesh Saligrama},\n  title        = {{RAPID:} Rapidly Accelerated Proximal Gradient Algorithms for Convex\n                  Minimization},\n  journal      = {CoRR},\n  volume       = {abs/1406.4445},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1406.4445},\n  eprinttype    = {arXiv},\n  eprint       = {1406.4445},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhangS14c.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Novel Visual Word Co-occurrence Model for Person Re-identification.\n \n \n \n \n\n\n \n Zhang, Z.; Chen, Y.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1410.6532. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/ZhangCS14,\n  author       = {Ziming Zhang and\n                  Yuting Chen and\n                  Venkatesh Saligrama},\n  title        = {A Novel Visual Word Co-occurrence Model for Person Re-identification},\n  journal      = {CoRR},\n  volume       = {abs/1410.6532},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1410.6532},\n  eprinttype    = {arXiv},\n  eprint       = {1410.6532},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ZhangCS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Non-Adaptive Group Testing with Inhibitors.\n \n \n \n \n\n\n \n Ganesan, A.; Ebrahimi, J.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1410.8440. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"Non-Adaptive$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/GanesanEJS14,\n  author       = {Abhinav Ganesan and\n                  Javad Ebrahimi and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama},\n  title        = {Non-Adaptive Group Testing with Inhibitors},\n  journal      = {CoRR},\n  volume       = {abs/1410.8440},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1410.8440},\n  eprinttype    = {arXiv},\n  eprint       = {1410.8440},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/GanesanEJS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Topic Modeling Approach to Ranking.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1412.3705. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/DingIS14,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {A Topic Modeling Approach to Ranking},\n  journal      = {CoRR},\n  volume       = {abs/1412.3705},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1412.3705},\n  eprinttype    = {arXiv},\n  eprint       = {1412.3705},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/DingIS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2013\n \n \n (20)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Introduction to the issue on anomalous pattern discovery for spatial, temporal, networked, and high-dimensional signals.\n \n \n \n \n\n\n \n Saligrama, V.; Arias-Castro, E.; Chellappa, R.; III, A. O. H.; Nowak, R. D.; and Veeravalli, V. V.\n\n\n \n\n\n\n IEEE J. Sel. Top. Signal Process., 7(1): 1–3. 2013.\n \n\n\n\n
\n\n\n\n \n \n $\"Introduction$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/jstsp/SaligramaACHNV13,\n  author       = {Venkatesh Saligrama and\n                  Ery Arias{-}Castro and\n                  Rama Chellappa and\n                  Alfred O. Hero III and\n                  Robert D. Nowak and\n                  Venugopal V. Veeravalli},\n  title        = {Introduction to the issue on anomalous pattern discovery for spatial,\n                  temporal, networked, and high-dimensional signals},\n  journal      = {{IEEE} J. Sel. Top. Signal Process.},\n  volume       = {7},\n  number       = {1},\n  pages        = {1--3},\n  year         = {2013},\n  url          = {https://doi.org/10.1109/JSTSP.2013.2239831},\n  doi          = {10.1109/JSTSP.2013.2239831},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/jstsp/SaligramaACHNV13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Multi-stage classifier design.\n \n \n \n \n\n\n \n Trapeznikov, K.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n Mach. Learn., 92(2-3): 479–502. 2013.\n \n\n\n\n
\n\n\n\n \n \n $\"Multi-stage$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/ml/TrapeznikovSC13,\n  author       = {Kirill Trapeznikov and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Multi-stage classifier design},\n  journal      = {Mach. Learn.},\n  volume       = {92},\n  number       = {2-3},\n  pages        = {479--502},\n  year         = {2013},\n  url          = {https://doi.org/10.1007/s10994-013-5349-4},\n  doi          = {10.1007/S10994-013-5349-4},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/ml/TrapeznikovSC13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Locally-Linear Learning Machines (L3M).\n \n \n \n \n\n\n \n Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n In Asian Conference on Machine Learning, ACML 2013, Canberra, ACT, Australia, November 13-15, 2013, pages 451–466, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"Locally-Linear$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/acml/WangS13,\n  author       = {Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Locally-Linear Learning Machines {(L3M)}},\n  booktitle    = {Asian Conference on Machine Learning, {ACML} 2013, Canberra, ACT,\n                  Australia, November 13-15, 2013},\n  pages        = {451--466},\n  year         = {2013},\n  crossref     = {DBLP:conf/acml/2013},\n  url          = {http://proceedings.mlr.press/v29/Wang13a.html},\n  timestamp    = {Wed, 29 May 2019 08:41:47 +0200},\n  biburl       = {https://dblp.org/rec/conf/acml/WangS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Dynamic topic discovery through sequential projections.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In 2013 Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, November 3-6, 2013, pages 1100–1104, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"Dynamic$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/acssc/DingIS13,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {Dynamic topic discovery through sequential projections},\n  booktitle    = {2013 Asilomar Conference on Signals, Systems and Computers, Pacific\n                  Grove, CA, USA, November 3-6, 2013},\n  pages        = {1100--1104},\n  year         = {2013},\n  crossref     = {DBLP:conf/acssc/2013},\n  url          = {https://doi.org/10.1109/ACSSC.2013.6810463},\n  doi          = {10.1109/ACSSC.2013.6810463},\n  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/acssc/DingIS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Supervised Sequential Classification Under Budget Constraints.\n \n \n \n \n\n\n \n Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2013, Scottsdale, AZ, USA, April 29 - May 1, 2013, pages 581–589, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"Supervised$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/aistats/TrapeznikovS13,\n  author       = {Kirill Trapeznikov and\n                  Venkatesh Saligrama},\n  title        = {Supervised Sequential Classification Under Budget Constraints},\n  booktitle    = {Proceedings of the Sixteenth International Conference on Artificial\n                  Intelligence and Statistics, {AISTATS} 2013, Scottsdale, AZ, USA,\n                  April 29 - May 1, 2013},\n  pages        = {581--589},\n  year         = {2013},\n  crossref     = {DBLP:conf/aistats/2013},\n  url          = {http://proceedings.mlr.press/v31/trapeznikov13a.html},\n  timestamp    = {Wed, 29 May 2019 08:41:44 +0200},\n  biburl       = {https://dblp.org/rec/conf/aistats/TrapeznikovS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sparse signal recovery under Poisson statistics.\n \n \n \n \n\n\n \n Motamedvaziri, D.; Rohban, M. H.; and Saligrama, V.\n\n\n \n\n\n\n In 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, Allerton Park & Retreat Center, Monticello, IL, USA, October 2-4, 2013, pages 1450–1457, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"Sparse$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/MotamedvaziriRS13,\n  author       = {Delaram Motamedvaziri and\n                  Mohammad H. Rohban and\n                  Venkatesh Saligrama},\n  title        = {Sparse signal recovery under Poisson statistics},\n  booktitle    = {51st Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2013, Allerton Park {\\&} Retreat Center, Monticello, IL,\n                  USA, October 2-4, 2013},\n  pages        = {1450--1457},\n  year         = {2013},\n  crossref     = {DBLP:conf/allerton/2013},\n  url          = {https://doi.org/10.1109/Allerton.2013.6736698},\n  doi          = {10.1109/ALLERTON.2013.6736698},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/allerton/MotamedvaziriRS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Online local linear classification.\n \n \n \n \n\n\n \n Wang, J.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n In 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2013, St. Martin, France, December 15-18, 2013, pages 173–176, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"Online$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/camsap/WangTS13,\n  author       = {Joseph Wang and\n                  Kirill Trapeznikov and\n                  Venkatesh Saligrama},\n  title        = {Online local linear classification},\n  booktitle    = {5th {IEEE} International Workshop on Computational Advances in Multi-Sensor\n                  Adaptive Processing, {CAMSAP} 2013, St. Martin, France, December 15-18,\n                  2013},\n  pages        = {173--176},\n  year         = {2013},\n  crossref     = {DBLP:conf/camsap/2013},\n  url          = {https://doi.org/10.1109/CAMSAP.2013.6714035},\n  doi          = {10.1109/CAMSAP.2013.6714035},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/camsap/WangTS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n User-assisted reflection detection and feature point tracking.\n \n \n \n \n\n\n \n Elgharib, M. A.; Pitié, F.; Kokaram, A. C.; and Saligrama, V.\n\n\n \n\n\n\n In Conference on Visual Media Production 2013, CVMP '13, London, United Kingdom, November 6-7, 2013, pages 13:1–13:10, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"User-assisted$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvmp/ElgharibPKS13,\n  author       = {Mohamed A. Elgharib and\n                  Fran{\\c{c}}ois Piti{\\'{e}} and\n                  Anil C. Kokaram and\n                  Venkatesh Saligrama},\n  title        = {User-assisted reflection detection and feature point tracking},\n  booktitle    = {Conference on Visual Media Production 2013, {CVMP} '13, London, United\n                  Kingdom, November 6-7, 2013},\n  pages        = {13:1--13:10},\n  year         = {2013},\n  crossref     = {DBLP:conf/cvmp/2013},\n  url          = {https://doi.org/10.1145/2534008.2534011},\n  doi          = {10.1145/2534008.2534011},\n  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/cvmp/ElgharibPKS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A new one-class SVM for anomaly detection.\n \n \n \n \n\n\n \n Chen, Y.; Qian, J.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2013, Vancouver, BC, Canada, May 26-31, 2013, pages 3567–3571, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/ChenQS13,\n  author       = {Yuting Chen and\n                  Jing Qian and\n                  Venkatesh Saligrama},\n  title        = {A new one-class {SVM} for anomaly detection},\n  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,\n                  {ICASSP} 2013, Vancouver, BC, Canada, May 26-31, 2013},\n  pages        = {3567--3571},\n  year         = {2013},\n  crossref     = {DBLP:conf/icassp/2013},\n  url          = {https://doi.org/10.1109/ICASSP.2013.6638322},\n  doi          = {10.1109/ICASSP.2013.6638322},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/ChenQS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Compressive sensing bounds through a unifying framework for sparse models.\n \n \n \n \n\n\n \n Aksoylar, C.; Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2013, Vancouver, BC, Canada, May 26-31, 2013, pages 5524–5528, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"Compressive$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/AksoylarAS13,\n  author       = {Cem Aksoylar and\n                  George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {Compressive sensing bounds through a unifying framework for sparse\n                  models},\n  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,\n                  {ICASSP} 2013, Vancouver, BC, Canada, May 26-31, 2013},\n  pages        = {5524--5528},\n  year         = {2013},\n  crossref     = {DBLP:conf/icassp/2013},\n  url          = {https://doi.org/10.1109/ICASSP.2013.6638720},\n  doi          = {10.1109/ICASSP.2013.6638720},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/AksoylarAS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A new geometric approach to latent topic modeling and discovery.\n \n \n \n \n\n\n \n Ding, W.; Rohban, M. H.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2013, Vancouver, BC, Canada, May 26-31, 2013, pages 5568–5572, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/DingRIS13,\n  author       = {Weicong Ding and\n                  Mohammad H. Rohban and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {A new geometric approach to latent topic modeling and discovery},\n  booktitle    = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,\n                  {ICASSP} 2013, Vancouver, BC, Canada, May 26-31, 2013},\n  pages        = {5568--5572},\n  year         = {2013},\n  crossref     = {DBLP:conf/icassp/2013},\n  url          = {https://doi.org/10.1109/ICASSP.2013.6638729},\n  doi          = {10.1109/ICASSP.2013.6638729},\n  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/DingRIS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Topic Discovery through Data Dependent and Random Projections.\n \n \n \n \n\n\n \n Ding, W.; Rohban, M. H.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 30th International Conference on Machine Learning, ICML 2013, Atlanta, GA, USA, 16-21 June 2013, pages 1202–1210, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"Topic$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icml/DingRIS13,\n  author       = {Weicong Ding and\n                  Mohammad Hossein Rohban and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {Topic Discovery through Data Dependent and Random Projections},\n  booktitle    = {Proceedings of the 30th International Conference on Machine Learning,\n                  {ICML} 2013, Atlanta, GA, USA, 16-21 June 2013},\n  pages        = {1202--1210},\n  year         = {2013},\n  crossref     = {DBLP:conf/icml/2013},\n  url          = {http://proceedings.mlr.press/v28/ding13.html},\n  timestamp    = {Wed, 29 May 2019 08:41:45 +0200},\n  biburl       = {https://dblp.org/rec/conf/icml/DingRIS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sparse signal processing with linear and non-linear observations: A unified shannon theoretic approach.\n \n \n \n \n\n\n \n Aksoylar, C.; Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n In 2013 IEEE Information Theory Workshop, ITW 2013, Sevilla, Spain, September 9-13, 2013, pages 1–5, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"Sparse$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/itw/AksoylarAS13,\n  author       = {Cem Aksoylar and\n                  George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {Sparse signal processing with linear and non-linear observations:\n                  {A} unified shannon theoretic approach},\n  booktitle    = {2013 {IEEE} Information Theory Workshop, {ITW} 2013, Sevilla, Spain,\n                  September 9-13, 2013},\n  pages        = {1--5},\n  year         = {2013},\n  crossref     = {DBLP:conf/itw/2013},\n  url          = {https://doi.org/10.1109/ITW.2013.6691346},\n  doi          = {10.1109/ITW.2013.6691346},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/itw/AksoylarAS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Stochastic threshold group testing.\n \n \n \n \n\n\n \n Chan, C. L.; Cai, S.; Bakshi, M.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n In 2013 IEEE Information Theory Workshop, ITW 2013, Sevilla, Spain, September 9-13, 2013, pages 1–5, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"Stochastic$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/itw/ChanCBJS13,\n  author       = {Chun Lam Chan and\n                  Sheng Cai and\n                  Mayank Bakshi and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama},\n  title        = {Stochastic threshold group testing},\n  booktitle    = {2013 {IEEE} Information Theory Workshop, {ITW} 2013, Sevilla, Spain,\n                  September 9-13, 2013},\n  pages        = {1--5},\n  year         = {2013},\n  crossref     = {DBLP:conf/itw/2013},\n  url          = {https://doi.org/10.1109/ITW.2013.6691242},\n  doi          = {10.1109/ITW.2013.6691242},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/itw/ChanCBJS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n An impossibility result for high dimensional supervised learning.\n \n \n \n \n\n\n \n Rohban, M. H.; Ishwar, P.; Orten, B.; Karl, W. C.; and Saligrama, V.\n\n\n \n\n\n\n In 2013 IEEE Information Theory Workshop, ITW 2013, Sevilla, Spain, September 9-13, 2013, pages 1–5, 2013. \n \n\n\n\n
\n\n\n\n \n \n $\"An$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/itw/RohbanIOKS13,\n  author       = {Mohammad H. Rohban and\n                  Prakash Ishwar and\n                  Burkay Orten and\n                  William Clement Karl and\n                  Venkatesh Saligrama},\n  title        = {An impossibility result for high dimensional supervised learning},\n  booktitle    = {2013 {IEEE} Information Theory Workshop, {ITW} 2013, Sevilla, Spain,\n                  September 9-13, 2013},\n  pages        = {1--5},\n  year         = {2013},\n  crossref     = {DBLP:conf/itw/2013},\n  url          = {https://doi.org/10.1109/ITW.2013.6691252},\n  doi          = {10.1109/ITW.2013.6691252},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/itw/RohbanIOKS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Topic Discovery through Data Dependent and Random Projections.\n \n \n \n \n\n\n \n Ding, W.; Rohban, M. H.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1303.3664. 2013.\n \n\n\n\n
\n\n\n\n \n \n $\"Topic$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1303-3664,\n  author       = {Weicong Ding and\n                  Mohammad H. Rohban and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {Topic Discovery through Data Dependent and Random Projections},\n  journal      = {CoRR},\n  volume       = {abs/1303.3664},\n  year         = {2013},\n  url          = {http://arxiv.org/abs/1303.3664},\n  eprinttype    = {arXiv},\n  eprint       = {1303.3664},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1303-3664.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sparse Signal Processing with Linear and Non-Linear Observations: A Unified Shannon Theoretic Approach.\n \n \n \n \n\n\n \n Aksoylar, C.; Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1304.0682. 2013.\n \n\n\n\n
\n\n\n\n \n \n $\"Sparse$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1304-0682,\n  author       = {Cem Aksoylar and\n                  George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {Sparse Signal Processing with Linear and Non-Linear Observations:\n                  {A} Unified Shannon Theoretic Approach},\n  journal      = {CoRR},\n  volume       = {abs/1304.0682},\n  year         = {2013},\n  url          = {http://arxiv.org/abs/1304.0682},\n  eprinttype    = {arXiv},\n  eprint       = {1304.0682},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1304-0682.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Near-Optimal Stochastic Threshold Group Testing.\n \n \n \n \n\n\n \n Chan, C. L.; Cai, S.; Bakshi, M.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1304.6027. 2013.\n \n\n\n\n
\n\n\n\n \n \n $\"Near-Optimal$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1304-6027,\n  author       = {Chun Lam Chan and\n                  Sheng Cai and\n                  Mayank Bakshi and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama},\n  title        = {Near-Optimal Stochastic Threshold Group Testing},\n  journal      = {CoRR},\n  volume       = {abs/1304.6027},\n  year         = {2013},\n  url          = {http://arxiv.org/abs/1304.6027},\n  eprinttype    = {arXiv},\n  eprint       = {1304.6027},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1304-6027.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Necessary and Sufficient Conditions for Novel Word Detection in Separable Topic Models.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; Rohban, M. H.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1310.7994. 2013.\n \n\n\n\n
\n\n\n\n \n \n $\"Necessary$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/DingIRS13,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Mohammad H. Rohban and\n                  Venkatesh Saligrama},\n  title        = {Necessary and Sufficient Conditions for Novel Word Detection in Separable\n                  Topic Models},\n  journal      = {CoRR},\n  volume       = {abs/1310.7994},\n  year         = {2013},\n  url          = {http://arxiv.org/abs/1310.7994},\n  eprinttype    = {arXiv},\n  eprint       = {1310.7994},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/DingIRS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sensing-Aware Kernel SVM.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; Saligrama, V.; and Karl, W. C.\n\n\n \n\n\n\n CoRR, abs/1312.0512. 2013.\n \n\n\n\n
\n\n\n\n \n \n $\"Sensing-Aware$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/DingISK13,\n  author       = {Weicong Ding and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama and\n                  W. Clem Karl},\n  title        = {Sensing-Aware Kernel {SVM}},\n  journal      = {CoRR},\n  volume       = {abs/1312.0512},\n  year         = {2013},\n  url          = {http://arxiv.org/abs/1312.0512},\n  eprinttype    = {arXiv},\n  eprint       = {1312.0512},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/DingISK13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2012\n \n \n (20)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Behavior Subtraction.\n \n \n \n \n\n\n \n Jodoin, P.; Saligrama, V.; and Konrad, J.\n\n\n \n\n\n\n IEEE Trans. Image Process., 21(9): 4244–4255. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Behavior$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tip/JodoinSK12,\n  author       = {Pierre{-}Marc Jodoin and\n                  Venkatesh Saligrama and\n                  Janusz Konrad},\n  title        = {Behavior Subtraction},\n  journal      = {{IEEE} Trans. Image Process.},\n  volume       = {21},\n  number       = {9},\n  pages        = {4244--4255},\n  year         = {2012},\n  url          = {https://doi.org/10.1109/TIP.2012.2199326},\n  doi          = {10.1109/TIP.2012.2199326},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tip/JodoinSK12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Graph-Constrained Group Testing.\n \n \n \n \n\n\n \n Cheraghchi, M.; Karbasi, A.; Mohajer, S.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 58(1): 248–262. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Graph-Constrained$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/CheraghchiKMS12,\n  author       = {Mahdi Cheraghchi and\n                  Amin Karbasi and\n                  Soheil Mohajer and\n                  Venkatesh Saligrama},\n  title        = {Graph-Constrained Group Testing},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {58},\n  number       = {1},\n  pages        = {248--262},\n  year         = {2012},\n  url          = {https://doi.org/10.1109/TIT.2011.2169535},\n  doi          = {10.1109/TIT.2011.2169535},\n  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/CheraghchiKMS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Boolean Compressed Sensing and Noisy Group Testing.\n \n \n \n \n\n\n \n Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 58(3): 1880–1901. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Boolean$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/AtiaS12,\n  author       = {George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {Boolean Compressed Sensing and Noisy Group Testing},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {58},\n  number       = {3},\n  pages        = {1880--1901},\n  year         = {2012},\n  url          = {https://doi.org/10.1109/TIT.2011.2178156},\n  doi          = {10.1109/TIT.2011.2178156},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/AtiaS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Aperiodic Sequences With Uniformly Decaying Correlations With Applications to Compressed Sensing and System Identification.\n \n \n \n \n\n\n \n Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 58(9): 6023–6036. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Aperiodic$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/Saligrama12,\n  author       = {Venkatesh Saligrama},\n  title        = {Aperiodic Sequences With Uniformly Decaying Correlations With Applications\n                  to Compressed Sensing and System Identification},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {58},\n  number       = {9},\n  pages        = {6023--6036},\n  year         = {2012},\n  url          = {https://doi.org/10.1109/TIT.2012.2204164},\n  doi          = {10.1109/TIT.2012.2204164},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/Saligrama12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Real-Time Activity Search of Surveillance Video.\n \n \n \n \n\n\n \n Castañón, G.; Saligrama, V.; Caron, A.; and Jodoin, P.\n\n\n \n\n\n\n In Ninth IEEE International Conference on Advanced Video and Signal-Based Surveillance, AVSS 2012, Beijing, China, September 18-21, 2012, pages 246–251, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Real-Time$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/avss/CastanonSCJ12,\n  author       = {Greg Casta{\\~{n}}{\\'{o}}n and\n                  Venkatesh Saligrama and\n                  Andr{\\'{e}}{-}Louis Caron and\n                  Pierre{-}Marc Jodoin},\n  title        = {Real-Time Activity Search of Surveillance Video},\n  booktitle    = {Ninth {IEEE} International Conference on Advanced Video and Signal-Based\n                  Surveillance, {AVSS} 2012, Beijing, China, September 18-21, 2012},\n  pages        = {246--251},\n  year         = {2012},\n  crossref     = {DBLP:conf/avss/2012},\n  url          = {https://doi.org/10.1109/AVSS.2012.58},\n  doi          = {10.1109/AVSS.2012.58},\n  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/avss/CastanonSCJ12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Bayesian filtering without an observation model.\n \n \n \n \n\n\n \n Jones, P. B.; Mitter, S. K.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 51th IEEE Conference on Decision and Control, CDC 2012, December 10-13, 2012, Maui, HI, USA, pages 3496–3501, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Bayesian$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cdc/JonesMS12,\n  author       = {Peter B. Jones and\n                  Sanjoy K. Mitter and\n                  Venkatesh Saligrama},\n  title        = {Bayesian filtering without an observation model},\n  booktitle    = {Proceedings of the 51th {IEEE} Conference on Decision and Control,\n                  {CDC} 2012, December 10-13, 2012, Maui, HI, {USA}},\n  pages        = {3496--3501},\n  year         = {2012},\n  crossref     = {DBLP:conf/cdc/2012},\n  url          = {https://doi.org/10.1109/CDC.2012.6426655},\n  doi          = {10.1109/CDC.2012.6426655},\n  timestamp    = {Fri, 04 Mar 2022 13:28:47 +0100},\n  biburl       = {https://dblp.org/rec/conf/cdc/JonesMS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Video anomaly detection based on local statistical aggregates.\n \n \n \n \n\n\n \n Saligrama, V.; and Chen, Z.\n\n\n \n\n\n\n In 2012 IEEE Conference on Computer Vision and Pattern Recognition, Providence, RI, USA, June 16-21, 2012, pages 2112–2119, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Video$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/SaligramaC12,\n  author       = {Venkatesh Saligrama and\n                  Zhu Chen},\n  title        = {Video anomaly detection based on local statistical aggregates},\n  booktitle    = {2012 {IEEE} Conference on Computer Vision and Pattern Recognition,\n                  Providence, RI, USA, June 16-21, 2012},\n  pages        = {2112--2119},\n  year         = {2012},\n  crossref     = {DBLP:conf/cvpr/2012},\n  url          = {https://doi.org/10.1109/CVPR.2012.6247917},\n  doi          = {10.1109/CVPR.2012.6247917},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cvpr/SaligramaC12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Non-adaptive group testing: Explicit bounds and novel algorithms.\n \n \n \n \n\n\n \n Chan, C. L.; Jaggi, S.; Saligrama, V.; and Agnihotri, S.\n\n\n \n\n\n\n In Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012, pages 1837–1841, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Non-adaptive$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/isit/ChanJSA12,\n  author       = {Chun Lam Chan and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama and\n                  Samar Agnihotri},\n  title        = {Non-adaptive group testing: Explicit bounds and novel algorithms},\n  booktitle    = {Proceedings of the 2012 {IEEE} International Symposium on Information\n                  Theory, {ISIT} 2012, Cambridge, MA, USA, July 1-6, 2012},\n  pages        = {1837--1841},\n  year         = {2012},\n  crossref     = {DBLP:conf/isit/2012},\n  url          = {https://doi.org/10.1109/ISIT.2012.6283597},\n  doi          = {10.1109/ISIT.2012.6283597},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/isit/ChanJSA12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Exploratory search of long surveillance videos.\n \n \n \n \n\n\n \n Castañón, G. D.; Caron, A.; Saligrama, V.; and Jodoin, P.\n\n\n \n\n\n\n In Proceedings of the 20th ACM Multimedia Conference, MM '12, Nara, Japan, October 29 - November 02, 2012, pages 309–318, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Exploratory$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/mm/CastanonCSJ12,\n  author       = {Gregory D. Casta{\\~{n}}{\\'{o}}n and\n                  Andr{\\'{e}}{-}Louis Caron and\n                  Venkatesh Saligrama and\n                  Pierre{-}Marc Jodoin},\n  title        = {Exploratory search of long surveillance videos},\n  booktitle    = {Proceedings of the 20th {ACM} Multimedia Conference, {MM} '12, Nara,\n                  Japan, October 29 - November 02, 2012},\n  pages        = {309--318},\n  year         = {2012},\n  crossref     = {DBLP:conf/mm/2012},\n  url          = {https://doi.org/10.1145/2393347.2393394},\n  doi          = {10.1145/2393347.2393394},\n  timestamp    = {Tue, 20 Jul 2021 15:36:10 +0200},\n  biburl       = {https://dblp.org/rec/conf/mm/CastanonCSJ12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Local Supervised Learning through Space Partitioning.\n \n \n \n \n\n\n \n Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012, Lake Tahoe, Nevada, United States, pages 91–99, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Local$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/WangS12,\n  author       = {Joseph Wang and\n                  Venkatesh Saligrama},\n  title        = {Local Supervised Learning through Space Partitioning},\n  booktitle    = {Advances in Neural Information Processing Systems 25: 26th Annual\n                  Conference on Neural Information Processing Systems 2012. Proceedings\n                  of a meeting held December 3-6, 2012, Lake Tahoe, Nevada, United States},\n  pages        = {91--99},\n  year         = {2012},\n  crossref     = {DBLP:conf/nips/2012},\n  url          = {https://proceedings.neurips.cc/paper/2012/hash/a684eceee76fc522773286a895bc8436-Abstract.html},\n  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/nips/WangS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sample complexity of salient feature identification for sparse signal processing.\n \n \n \n \n\n\n \n Aksoylar, C.; Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE Statistical Signal Processing Workshop, SSP 2012, Ann Arbor, MI, USA, August 5-8, 2012, pages 329–332, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Sample$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ssp/AksoylarAS12,\n  author       = {Cem Aksoylar and\n                  George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {Sample complexity of salient feature identification for sparse signal\n                  processing},\n  booktitle    = {{IEEE} Statistical Signal Processing Workshop, {SSP} 2012, Ann Arbor,\n                  MI, USA, August 5-8, 2012},\n  pages        = {329--332},\n  year         = {2012},\n  crossref     = {DBLP:conf/ssp/2012},\n  url          = {https://doi.org/10.1109/SSP.2012.6319695},\n  doi          = {10.1109/SSP.2012.6319695},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ssp/AksoylarAS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n New statistic in P-value estimation for anomaly detection.\n \n \n \n \n\n\n \n Qian, J.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE Statistical Signal Processing Workshop, SSP 2012, Ann Arbor, MI, USA, August 5-8, 2012, pages 393–396, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"New$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ssp/QianS12,\n  author       = {Jing Qian and\n                  Venkatesh Saligrama},\n  title        = {New statistic in P-value estimation for anomaly detection},\n  booktitle    = {{IEEE} Statistical Signal Processing Workshop, {SSP} 2012, Ann Arbor,\n                  MI, USA, August 5-8, 2012},\n  pages        = {393--396},\n  year         = {2012},\n  crossref     = {DBLP:conf/ssp/2012},\n  url          = {https://doi.org/10.1109/SSP.2012.6319713},\n  doi          = {10.1109/SSP.2012.6319713},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ssp/QianS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sensing aware dimensionality reduction for nearest neighbor classification of high dimensional signals.\n \n \n \n \n\n\n \n Sun, Z.; Karl, W. C.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE Statistical Signal Processing Workshop, SSP 2012, Ann Arbor, MI, USA, August 5-8, 2012, pages 405–408, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Sensing$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ssp/SunKIS12,\n  author       = {Zachary Sun and\n                  W. Clem Karl and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {Sensing aware dimensionality reduction for nearest neighbor classification\n                  of high dimensional signals},\n  booktitle    = {{IEEE} Statistical Signal Processing Workshop, {SSP} 2012, Ann Arbor,\n                  MI, USA, August 5-8, 2012},\n  pages        = {405--408},\n  year         = {2012},\n  crossref     = {DBLP:conf/ssp/2012},\n  url          = {https://doi.org/10.1109/SSP.2012.6319716},\n  doi          = {10.1109/SSP.2012.6319716},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ssp/SunKIS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A combined approach to multi-label multi-task learning.\n \n \n \n \n\n\n \n Motamedvaziri, D.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n In IEEE Statistical Signal Processing Workshop, SSP 2012, Ann Arbor, MI, USA, August 5-8, 2012, pages 616–619, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ssp/MotamedvaziriSC12,\n  author       = {Delaram Motamedvaziri and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {A combined approach to multi-label multi-task learning},\n  booktitle    = {{IEEE} Statistical Signal Processing Workshop, {SSP} 2012, Ann Arbor,\n                  MI, USA, August 5-8, 2012},\n  pages        = {616--619},\n  year         = {2012},\n  crossref     = {DBLP:conf/ssp/2012},\n  url          = {https://doi.org/10.1109/SSP.2012.6319775},\n  doi          = {10.1109/SSP.2012.6319775},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ssp/MotamedvaziriSC12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Two stage decision system.\n \n \n \n \n\n\n \n Trapeznikov, K.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n In IEEE Statistical Signal Processing Workshop, SSP 2012, Ann Arbor, MI, USA, August 5-8, 2012, pages 920–923, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Two$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ssp/TrapeznikovSC12,\n  author       = {Kirill Trapeznikov and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Two stage decision system},\n  booktitle    = {{IEEE} Statistical Signal Processing Workshop, {SSP} 2012, Ann Arbor,\n                  MI, USA, August 5-8, 2012},\n  pages        = {920--923},\n  year         = {2012},\n  crossref     = {DBLP:conf/ssp/2012},\n  url          = {https://doi.org/10.1109/SSP.2012.6319859},\n  doi          = {10.1109/SSP.2012.6319859},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ssp/TrapeznikovSC12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Multi-Stage Classifier Design.\n \n \n \n \n\n\n \n Trapeznikov, K.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n In Proceedings of the 4th Asian Conference on Machine Learning, ACML 2012, Singapore, Singapore, November 4-6, 2012, pages 459–474, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Multi-Stage$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:journals/jmlr/TrapeznikovSC12,\n  author       = {Kirill Trapeznikov and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Multi-Stage Classifier Design},\n  booktitle    = {Proceedings of the 4th Asian Conference on Machine Learning, {ACML}\n                  2012, Singapore, Singapore, November 4-6, 2012},\n  pages        = {459--474},\n  year         = {2012},\n  crossref     = {DBLP:conf/acml/2012},\n  url          = {http://proceedings.mlr.press/v25/trapeznikov12.html},\n  timestamp    = {Wed, 29 May 2019 08:41:47 +0200},\n  biburl       = {https://dblp.org/rec/journals/jmlr/TrapeznikovSC12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Local Anomaly Detection.\n \n \n \n \n\n\n \n Saligrama, V.; and Zhao, M.\n\n\n \n\n\n\n In Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2012, La Palma, Canary Islands, Spain, April 21-23, 2012, pages 969–983, 2012. \n \n\n\n\n
\n\n\n\n \n \n $\"Local$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:journals/jmlr/SaligramaZ12,\n  author       = {Venkatesh Saligrama and\n                  Manqi Zhao},\n  title        = {Local Anomaly Detection},\n  booktitle    = {Proceedings of the Fifteenth International Conference on Artificial\n                  Intelligence and Statistics, {AISTATS} 2012, La Palma, Canary Islands,\n                  Spain, April 21-23, 2012},\n  pages        = {969--983},\n  year         = {2012},\n  crossref     = {DBLP:conf/aistats/2012},\n  url          = {http://proceedings.mlr.press/v22/saligrama12.html},\n  timestamp    = {Wed, 29 May 2019 08:41:44 +0200},\n  biburl       = {https://dblp.org/rec/journals/jmlr/SaligramaZ12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Non-adaptive Group Testing: Explicit bounds and novel algorithms.\n \n \n \n \n\n\n \n Chan, C. L.; Jaggi, S.; Saligrama, V.; and Agnihotri, S.\n\n\n \n\n\n\n CoRR, abs/1202.0206. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Non-adaptive$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1202-0206,\n  author       = {Chun Lam Chan and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama and\n                  Samar Agnihotri},\n  title        = {Non-adaptive Group Testing: Explicit bounds and novel algorithms},\n  journal      = {CoRR},\n  volume       = {abs/1202.0206},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1202.0206},\n  eprinttype    = {arXiv},\n  eprint       = {1202.0206},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1202-0206.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Graph-based Learning with Unbalanced Clusters.\n \n \n \n \n\n\n \n Qian, J.; Saligrama, V.; and Zhao, M.\n\n\n \n\n\n\n CoRR, abs/1205.1496. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Graph-based$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1205-1496,\n  author       = {Jing Qian and\n                  Venkatesh Saligrama and\n                  Manqi Zhao},\n  title        = {Graph-based Learning with Unbalanced Clusters},\n  journal      = {CoRR},\n  volume       = {abs/1205.1496},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1205.1496},\n  eprinttype    = {arXiv},\n  eprint       = {1205.1496},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1205-1496.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Cost Sensitive Sequential Classification.\n \n \n \n \n\n\n \n Trapeznikov, K.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n CoRR, abs/1205.4377. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Cost$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1205-4377,\n  author       = {Kirill Trapeznikov and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Cost Sensitive Sequential Classification},\n  journal      = {CoRR},\n  volume       = {abs/1205.4377},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1205.4377},\n  eprinttype    = {arXiv},\n  eprint       = {1205.4377},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1205-4377.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2011\n \n \n (11)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n A Token-Based Approach for Distributed Computation in Sensor Networks.\n \n \n \n \n\n\n \n Saligrama, V.; and Alanyali, M.\n\n\n \n\n\n\n IEEE J. Sel. Top. Signal Process., 5(4): 817–832. 2011.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/jstsp/SaligramaA11,\n  author       = {Venkatesh Saligrama and\n                  Murat Alanyali},\n  title        = {A Token-Based Approach for Distributed Computation in Sensor Networks},\n  journal      = {{IEEE} J. Sel. Top. Signal Process.},\n  volume       = {5},\n  number       = {4},\n  pages        = {817--832},\n  year         = {2011},\n  url          = {https://doi.org/10.1109/JSTSP.2011.2125776},\n  doi          = {10.1109/JSTSP.2011.2125776},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/jstsp/SaligramaA11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Abnormality detection using low-level co-occurring events.\n \n \n \n \n\n\n \n Benezeth, Y.; Jodoin, P.; and Saligrama, V.\n\n\n \n\n\n\n Pattern Recognit. Lett., 32(3): 423–431. 2011.\n \n\n\n\n
\n\n\n\n \n \n $\"Abnormality$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/prl/BenezethJS11,\n  author       = {Yannick Benezeth and\n                  Pierre{-}Marc Jodoin and\n                  Venkatesh Saligrama},\n  title        = {Abnormality detection using low-level co-occurring events},\n  journal      = {Pattern Recognit. Lett.},\n  volume       = {32},\n  number       = {3},\n  pages        = {423--431},\n  year         = {2011},\n  url          = {https://doi.org/10.1016/j.patrec.2010.10.008},\n  doi          = {10.1016/J.PATREC.2010.10.008},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/prl/BenezethJS11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Thresholded Basis Pursuit: LP Algorithm for Order-Wise Optimal Support Recovery for Sparse and Approximately Sparse Signals From Noisy Random Measurements.\n \n \n \n \n\n\n \n Saligrama, V.; and Zhao, M.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 57(3): 1567–1586. 2011.\n \n\n\n\n
\n\n\n\n \n \n $\"Thresholded$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/SaligramaZ11,\n  author       = {Venkatesh Saligrama and\n                  Manqi Zhao},\n  title        = {Thresholded Basis Pursuit: {LP} Algorithm for Order-Wise Optimal Support\n                  Recovery for Sparse and Approximately Sparse Signals From Noisy Random\n                  Measurements},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {57},\n  number       = {3},\n  pages        = {1567--1586},\n  year         = {2011},\n  url          = {https://doi.org/10.1109/TIT.2011.2104512},\n  doi          = {10.1109/TIT.2011.2104512},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/SaligramaZ11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Broadband Dispersion Extraction Using Simultaneous Sparse Penalization.\n \n \n \n \n\n\n \n Aeron, S.; Bose, S.; Valero, H.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Signal Process., 59(10): 4821–4837. 2011.\n \n\n\n\n
\n\n\n\n \n \n $\"Broadband$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tsp/AeronBVS11,\n  author       = {Shuchin Aeron and\n                  Sandip Bose and\n                  Henri{-}Pierre Valero and\n                  Venkatesh Saligrama},\n  title        = {Broadband Dispersion Extraction Using Simultaneous Sparse Penalization},\n  journal      = {{IEEE} Trans. Signal Process.},\n  volume       = {59},\n  number       = {10},\n  pages        = {4821--4837},\n  year         = {2011},\n  url          = {https://doi.org/10.1109/TSP.2011.2160632},\n  doi          = {10.1109/TSP.2011.2160632},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tsp/AeronBVS11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Structural similarity and distance in learning.\n \n \n \n \n\n\n \n Wang, J.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n In 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Allerton Park & Retreat Center, Monticello, IL, USA, 28-30 September, 2011, pages 744–751, 2011. \n \n\n\n\n
\n\n\n\n \n \n $\"Structural$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/WangSC11,\n  author       = {Joseph Wang and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Structural similarity and distance in learning},\n  booktitle    = {49th Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2011, Allerton Park {\\&} Retreat Center, Monticello, IL,\n                  USA, 28-30 September, 2011},\n  pages        = {744--751},\n  year         = {2011},\n  crossref     = {DBLP:conf/allerton/2011},\n  url          = {https://doi.org/10.1109/Allerton.2011.6120242},\n  doi          = {10.1109/ALLERTON.2011.6120242},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/allerton/WangSC11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sensing structure in learning-based binary classification of high-dimensional data.\n \n \n \n \n\n\n \n Orten, B.; Ishwar, P.; Karl, W. C.; and Saligrama, V.\n\n\n \n\n\n\n In 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Allerton Park & Retreat Center, Monticello, IL, USA, 28-30 September, 2011, pages 1521–1528, 2011. \n \n\n\n\n
\n\n\n\n \n \n $\"Sensing$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/OrtenIKS11,\n  author       = {Burkay Orten and\n                  Prakash Ishwar and\n                  William Clement Karl and\n                  Venkatesh Saligrama},\n  title        = {Sensing structure in learning-based binary classification of high-dimensional\n                  data},\n  booktitle    = {49th Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2011, Allerton Park {\\&} Retreat Center, Monticello, IL,\n                  USA, 28-30 September, 2011},\n  pages        = {1521--1528},\n  year         = {2011},\n  crossref     = {DBLP:conf/allerton/2011},\n  url          = {https://doi.org/10.1109/Allerton.2011.6120348},\n  doi          = {10.1109/ALLERTON.2011.6120348},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/allerton/OrtenIKS11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms.\n \n \n \n \n\n\n \n Chan, C. L.; Che, P. H.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n In 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Allerton Park & Retreat Center, Monticello, IL, USA, 28-30 September, 2011, pages 1832–1839, 2011. \n \n\n\n\n
\n\n\n\n \n \n $\"Non-adaptive$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/ChanCJS11,\n  author       = {Chun Lam Chan and\n                  Pak Hou Che and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama},\n  title        = {Non-adaptive probabilistic group testing with noisy measurements:\n                  Near-optimal bounds with efficient algorithms},\n  booktitle    = {49th Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2011, Allerton Park {\\&} Retreat Center, Monticello, IL,\n                  USA, 28-30 September, 2011},\n  pages        = {1832--1839},\n  year         = {2011},\n  crossref     = {DBLP:conf/allerton/2011},\n  url          = {https://doi.org/10.1109/Allerton.2011.6120391},\n  doi          = {10.1109/ALLERTON.2011.6120391},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/allerton/ChanCJS11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sensing-aware classification with high-dimensional data.\n \n \n \n \n\n\n \n Orten, B.; Ishwar, P.; Karl, W. C.; Saligrama, V.; and Pien, H. H.\n\n\n \n\n\n\n In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011, May 22-27, 2011, Prague Congress Center, Prague, Czech Republic, pages 3700–3703, 2011. \n \n\n\n\n
\n\n\n\n \n \n $\"Sensing-aware$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/OrtenIKSP11,\n  author       = {Burkay Orten and\n                  Prakash Ishwar and\n                  W. Clem Karl and\n                  Venkatesh Saligrama and\n                  Homer H. Pien},\n  title        = {Sensing-aware classification with high-dimensional data},\n  booktitle    = {Proceedings of the {IEEE} International Conference on Acoustics, Speech,\n                  and Signal Processing, {ICASSP} 2011, May 22-27, 2011, Prague Congress\n                  Center, Prague, Czech Republic},\n  pages        = {3700--3703},\n  year         = {2011},\n  crossref     = {DBLP:conf/icassp/2011},\n  url          = {https://doi.org/10.1109/ICASSP.2011.5947154},\n  doi          = {10.1109/ICASSP.2011.5947154},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/OrtenIKSP11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Active Boosted Learning (ActBoost).\n \n \n \n \n\n\n \n Trapeznikov, K.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2011, Fort Lauderdale, USA, April 11-13, 2011, pages 743–751, 2011. \n \n\n\n\n
\n\n\n\n \n \n $\"Active$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:journals/jmlr/TrapeznikovSC11,\n  author       = {Kirill Trapeznikov and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Active Boosted Learning (ActBoost)},\n  booktitle    = {Proceedings of the Fourteenth International Conference on Artificial\n                  Intelligence and Statistics, {AISTATS} 2011, Fort Lauderdale, USA,\n                  April 11-13, 2011},\n  pages        = {743--751},\n  year         = {2011},\n  crossref     = {DBLP:conf/aistats/2011},\n  url          = {http://proceedings.mlr.press/v15/trapeznikov11a/trapeznikov11a.pdf},\n  timestamp    = {Wed, 29 May 2019 08:41:44 +0200},\n  biburl       = {https://dblp.org/rec/journals/jmlr/TrapeznikovSC11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Token Based Algorithm to Distributed Computation in Sensor Networks.\n \n \n \n \n\n\n \n Saligrama, V.; and Alanyali, M.\n\n\n \n\n\n\n CoRR, abs/1103.2289. 2011.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1103-2289,\n  author       = {Venkatesh Saligrama and\n                  Murat Alanyali},\n  title        = {A Token Based Algorithm to Distributed Computation in Sensor Networks},\n  journal      = {CoRR},\n  volume       = {abs/1103.2289},\n  year         = {2011},\n  url          = {http://arxiv.org/abs/1103.2289},\n  eprinttype    = {arXiv},\n  eprint       = {1103.2289},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1103-2289.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms.\n \n \n \n \n\n\n \n Chan, C. L.; Che, P. H.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1107.4540. 2011.\n \n\n\n\n
\n\n\n\n \n \n $\"Non-adaptive$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1107-4540,\n  author       = {Chun Lam Chan and\n                  Pak Hou Che and\n                  Sidharth Jaggi and\n                  Venkatesh Saligrama},\n  title        = {Non-adaptive probabilistic group testing with noisy measurements:\n                  Near-optimal bounds with efficient algorithms},\n  journal      = {CoRR},\n  volume       = {abs/1107.4540},\n  year         = {2011},\n  url          = {http://arxiv.org/abs/1107.4540},\n  eprinttype    = {arXiv},\n  eprint       = {1107.4540},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-4540.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2010\n \n \n (14)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Video Anomaly Identification.\n \n \n \n \n\n\n \n Saligrama, V.; Konrad, J.; and Jodoin, P.\n\n\n \n\n\n\n IEEE Signal Process. Mag., 27(5): 18–33. 2010.\n \n\n\n\n
\n\n\n\n \n \n $\"Video$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/spm/SaligramaKJ10,\n  author       = {Venkatesh Saligrama and\n                  Janusz Konrad and\n                  Pierre{-}Marc Jodoin},\n  title        = {Video Anomaly Identification},\n  journal      = {{IEEE} Signal Process. Mag.},\n  volume       = {27},\n  number       = {5},\n  pages        = {18--33},\n  year         = {2010},\n  url          = {https://doi.org/10.1109/MSP.2010.937393},\n  doi          = {10.1109/MSP.2010.937393},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/spm/SaligramaKJ10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Activity Based Matching in Distributed Camera Networks.\n \n \n \n \n\n\n \n Ermis, E. B.; Clarot, P.; Jodoin, P.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Image Process., 19(10): 2595–2613. 2010.\n \n\n\n\n
\n\n\n\n \n \n $\"Activity$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tip/ErmisCJS10,\n  author       = {Erhan Baki Ermis and\n                  Pierre Clarot and\n                  Pierre{-}Marc Jodoin and\n                  Venkatesh Saligrama},\n  title        = {Activity Based Matching in Distributed Camera Networks},\n  journal      = {{IEEE} Trans. Image Process.},\n  volume       = {19},\n  number       = {10},\n  pages        = {2595--2613},\n  year         = {2010},\n  url          = {https://doi.org/10.1109/TIP.2010.2052824},\n  doi          = {10.1109/TIP.2010.2052824},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tip/ErmisCJS10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Information theoretic bounds for compressed sensing.\n \n \n \n \n\n\n \n Aeron, S.; Saligrama, V.; and Zhao, M.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 56(10): 5111–5130. 2010.\n \n\n\n\n
\n\n\n\n \n \n $\"Information$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/AeronSZ10,\n  author       = {Shuchin Aeron and\n                  Venkatesh Saligrama and\n                  Manqi Zhao},\n  title        = {Information theoretic bounds for compressed sensing},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {56},\n  number       = {10},\n  pages        = {5111--5130},\n  year         = {2010},\n  url          = {https://doi.org/10.1109/TIT.2010.2059891},\n  doi          = {10.1109/TIT.2010.2059891},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/AeronSZ10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Distributed detection in sensor networks with limited range multimodal sensors.\n \n \n \n \n\n\n \n Ermis, E. B.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Signal Process., 58(2): 843–858. 2010.\n \n\n\n\n
\n\n\n\n \n \n $\"Distributed$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tsp/ErmisS10,\n  author       = {Erhan Baki Ermis and\n                  Venkatesh Saligrama},\n  title        = {Distributed detection in sensor networks with limited range multimodal\n                  sensors},\n  journal      = {{IEEE} Trans. Signal Process.},\n  volume       = {58},\n  number       = {2},\n  pages        = {843--858},\n  year         = {2010},\n  url          = {https://doi.org/10.1109/TSP.2009.2033300},\n  doi          = {10.1109/TSP.2009.2033300},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tsp/ErmisS10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Markov group testing.\n \n \n \n \n\n\n \n Wang, J.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n In 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, Monticello, IL, USA, September 29 - October 1, 2020, pages 160–166, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Markov$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/WangSC10,\n  author       = {Joseph Wang and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Markov group testing},\n  booktitle    = {48th Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2010, Monticello, IL, USA, September 29 - October 1, 2020},\n  pages        = {160--166},\n  year         = {2010},\n  crossref     = {DBLP:conf/allerton/2010},\n  url          = {https://doi.org/10.1109/ALLERTON.2010.5706902},\n  doi          = {10.1109/ALLERTON.2010.5706902},\n  timestamp    = {Sun, 17 Dec 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/allerton/WangSC10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Decentralized compressive sensing.\n \n \n \n \n\n\n \n Motamedvaziri, D.; Saligrama, V.; and Castanon, D.\n\n\n \n\n\n\n In 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, Monticello, IL, USA, September 29 - October 1, 2020, pages 607–614, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Decentralized$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/MotamedvaziriSC10,\n  author       = {Delaram Motamedvaziri and\n                  Venkatesh Saligrama and\n                  David Castanon},\n  title        = {Decentralized compressive sensing},\n  booktitle    = {48th Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2010, Monticello, IL, USA, September 29 - October 1, 2020},\n  pages        = {607--614},\n  year         = {2010},\n  crossref     = {DBLP:conf/allerton/2010},\n  url          = {https://doi.org/10.1109/ALLERTON.2010.5706963},\n  doi          = {10.1109/ALLERTON.2010.5706963},\n  timestamp    = {Sun, 17 Dec 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/allerton/MotamedvaziriSC10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Noisy filtered sparse processes: Reconstruction and compression.\n \n \n \n \n\n\n \n Zhao, M.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 49th IEEE Conference on Decision and Control, CDC 2010, December 15-17, 2010, Atlanta, Georgia, USA, pages 2930–2935, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Noisy$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cdc/ZhaoS10,\n  author       = {Manqi Zhao and\n                  Venkatesh Saligrama},\n  title        = {Noisy filtered sparse processes: Reconstruction and compression},\n  booktitle    = {Proceedings of the 49th {IEEE} Conference on Decision and Control,\n                  {CDC} 2010, December 15-17, 2010, Atlanta, Georgia, {USA}},\n  pages        = {2930--2935},\n  year         = {2010},\n  crossref     = {DBLP:conf/cdc/2010},\n  url          = {https://doi.org/10.1109/CDC.2010.5717521},\n  doi          = {10.1109/CDC.2010.5717521},\n  timestamp    = {Fri, 04 Mar 2022 13:28:01 +0100},\n  biburl       = {https://dblp.org/rec/conf/cdc/ZhaoS10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Revision of marginal probability assessments.\n \n \n \n \n\n\n \n Jones, P. B.; Mitter, S. K.; and Saligrama, V.\n\n\n \n\n\n\n In 13th Conference on Information Fusion, FUSION 2010, Edinburgh, UK, July 26-29, 2010, pages 1–8, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Revision$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/fusion/JonesMS10,\n  author       = {Peter B. Jones and\n                  Sanjoy K. Mitter and\n                  Venkatesh Saligrama},\n  title        = {Revision of marginal probability assessments},\n  booktitle    = {13th Conference on Information Fusion, {FUSION} 2010, Edinburgh, UK,\n                  July 26-29, 2010},\n  pages        = {1--8},\n  year         = {2010},\n  crossref     = {DBLP:conf/fusion/2010},\n  url          = {https://ieeexplore.ieee.org/document/5711875/},\n  timestamp    = {Mon, 09 Aug 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/fusion/JonesMS10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A new algorithm for outlier rejection in particle filters.\n \n \n \n \n\n\n \n Kumar, R.; Castañón, D. A.; Ermis, E. B.; and Saligrama, V.\n\n\n \n\n\n\n In 13th Conference on Information Fusion, FUSION 2010, Edinburgh, UK, July 26-29, 2010, pages 1–7, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/fusion/KumarCES10,\n  author       = {Rohit Kumar and\n                  David A. Casta{\\~{n}}{\\'{o}}n and\n                  Erhan Baki Ermis and\n                  Venkatesh Saligrama},\n  title        = {A new algorithm for outlier rejection in particle filters},\n  booktitle    = {13th Conference on Information Fusion, {FUSION} 2010, Edinburgh, UK,\n                  July 26-29, 2010},\n  pages        = {1--7},\n  year         = {2010},\n  crossref     = {DBLP:conf/fusion/2010},\n  url          = {https://ieeexplore.ieee.org/document/5712014/},\n  timestamp    = {Mon, 09 Aug 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/fusion/KumarCES10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sparsity penalized reconstruction framework for broadband dispersion extraction.\n \n \n \n \n\n\n \n Aeron, S.; Bose, S.; Valero, H.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010, 14-19 March 2010, Sheraton Dallas Hotel, Dallas, Texas, USA, pages 2638–2641, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Sparsity$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/AeronBVS10,\n  author       = {Shuchin Aeron and\n                  Sandip Bose and\n                  Henri{-}Pierre Valero and\n                  Venkatesh Saligrama},\n  title        = {Sparsity penalized reconstruction framework for broadband dispersion\n                  extraction},\n  booktitle    = {Proceedings of the {IEEE} International Conference on Acoustics, Speech,\n                  and Signal Processing, {ICASSP} 2010, 14-19 March 2010, Sheraton Dallas\n                  Hotel, Dallas, Texas, {USA}},\n  pages        = {2638--2641},\n  year         = {2010},\n  crossref     = {DBLP:conf/icassp/2010},\n  url          = {https://doi.org/10.1109/ICASSP.2010.5496259},\n  doi          = {10.1109/ICASSP.2010.5496259},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/AeronBVS10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On compressed blind de-convolution of filtered sparse processes.\n \n \n \n \n\n\n \n Zhao, M.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010, 14-19 March 2010, Sheraton Dallas Hotel, Dallas, Texas, USA, pages 4038–4041, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/ZhaoS10a,\n  author       = {Manqi Zhao and\n                  Venkatesh Saligrama},\n  title        = {On compressed blind de-convolution of filtered sparse processes},\n  booktitle    = {Proceedings of the {IEEE} International Conference on Acoustics, Speech,\n                  and Signal Processing, {ICASSP} 2010, 14-19 March 2010, Sheraton Dallas\n                  Hotel, Dallas, Texas, {USA}},\n  pages        = {4038--4041},\n  year         = {2010},\n  crossref     = {DBLP:conf/icassp/2010},\n  url          = {https://doi.org/10.1109/ICASSP.2010.5495759},\n  doi          = {10.1109/ICASSP.2010.5495759},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/ZhaoS10a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Graph-constrained group testing.\n \n \n \n \n\n\n \n Cheraghchi, M.; Karbasi, A.; Mohajer, S.; and Saligrama, V.\n\n\n \n\n\n\n In IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings, pages 1913–1917, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Graph-constrained$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/isit/CheraghchiKMS10,\n  author       = {Mahdi Cheraghchi and\n                  Amin Karbasi and\n                  Soheil Mohajer and\n                  Venkatesh Saligrama},\n  title        = {Graph-constrained group testing},\n  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2010,\n                  June 13-18, 2010, Austin, Texas, USA, Proceedings},\n  pages        = {1913--1917},\n  year         = {2010},\n  crossref     = {DBLP:conf/isit/2010},\n  url          = {https://doi.org/10.1109/ISIT.2010.5513397},\n  doi          = {10.1109/ISIT.2010.5513397},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/isit/CheraghchiKMS10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Probabilistic Belief Revision with Structural Constraints.\n \n \n \n \n\n\n \n Jones, P. B.; Saligrama, V.; and Mitter, S. K.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, Vancouver, British Columbia, Canada, pages 1036–1044, 2010. \n \n\n\n\n
\n\n\n\n \n \n $\"Probabilistic$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/JonesSM10,\n  author       = {Peter B. Jones and\n                  Venkatesh Saligrama and\n                  Sanjoy K. Mitter},\n  title        = {Probabilistic Belief Revision with Structural Constraints},\n  booktitle    = {Advances in Neural Information Processing Systems 23: 24th Annual\n                  Conference on Neural Information Processing Systems 2010. Proceedings\n                  of a meeting held 6-9 December 2010, Vancouver, British Columbia,\n                  Canada},\n  pages        = {1036--1044},\n  year         = {2010},\n  crossref     = {DBLP:conf/nips/2010},\n  url          = {https://proceedings.neurips.cc/paper/2010/hash/1f4477bad7af3616c1f933a02bfabe4e-Abstract.html},\n  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/nips/JonesSM10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Graph-Constrained Group Testing.\n \n \n \n \n\n\n \n Cheraghchi, M.; Karbasi, A.; Mohajer, S.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/1001.1445. 2010.\n \n\n\n\n
\n\n\n\n \n \n $\"Graph-Constrained$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1001-1445,\n  author       = {Mahdi Cheraghchi and\n                  Amin Karbasi and\n                  Soheil Mohajer and\n                  Venkatesh Saligrama},\n  title        = {Graph-Constrained Group Testing},\n  journal      = {CoRR},\n  volume       = {abs/1001.1445},\n  year         = {2010},\n  url          = {http://arxiv.org/abs/1001.1445},\n  eprinttype    = {arXiv},\n  eprint       = {1001.1445},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1001-1445.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2009\n \n \n (12)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n A technical framework for light- handed regulation of cognitive radios.\n \n \n \n \n\n\n \n Sahai, A.; Woyach, K. A.; Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Commun. Mag., 47(3): 96–102. 2009.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/cm/SahaiWAS09,\n  author       = {Anant Sahai and\n                  Kristen Ann Woyach and\n                  George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {A technical framework for light- handed regulation of cognitive radios},\n  journal      = {{IEEE} Commun. Mag.},\n  volume       = {47},\n  number       = {3},\n  pages        = {96--102},\n  year         = {2009},\n  url          = {https://doi.org/10.1109/MCOM.2009.4804393},\n  doi          = {10.1109/MCOM.2009.4804393},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/cm/SahaiWAS09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Foreground-Adaptive Background Subtraction.\n \n \n \n \n\n\n \n McHugh, J. M.; Konrad, J.; Saligrama, V.; and Jodoin, P.\n\n\n \n\n\n\n IEEE Signal Process. Lett., 16(5): 390–393. 2009.\n \n\n\n\n
\n\n\n\n \n \n $\"Foreground-Adaptive$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/spl/McHughKSJ09,\n  author       = {J. Mike McHugh and\n                  Janusz Konrad and\n                  Venkatesh Saligrama and\n                  Pierre{-}Marc Jodoin},\n  title        = {Foreground-Adaptive Background Subtraction},\n  journal      = {{IEEE} Signal Process. Lett.},\n  volume       = {16},\n  number       = {5},\n  pages        = {390--393},\n  year         = {2009},\n  url          = {https://doi.org/10.1109/LSP.2009.2016447},\n  doi          = {10.1109/LSP.2009.2016447},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/spl/McHughKSJ09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Noisy group testing: An information theoretic perspective.\n \n \n \n \n\n\n \n Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n In 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009, pages 355–362, 2009. \n \n\n\n\n
\n\n\n\n \n \n $\"Noisy$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/AtiaS09,\n  author       = {George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {Noisy group testing: An information theoretic perspective},\n  booktitle    = {47th Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009},\n  pages        = {355--362},\n  year         = {2009},\n  crossref     = {DBLP:conf/allerton/2009},\n  url          = {https://doi.org/10.1109/ALLERTON.2009.5394787},\n  doi          = {10.1109/ALLERTON.2009.5394787},\n  timestamp    = {Sun, 17 Dec 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/allerton/AtiaS09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Outlier detection via localized p-value estimation.\n \n \n \n \n\n\n \n Zhao, M.; and Saligrama, V.\n\n\n \n\n\n\n In 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009, pages 1482–1489, 2009. \n \n\n\n\n
\n\n\n\n \n \n $\"Outlier$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/ZhaoS09,\n  author       = {Manqi Zhao and\n                  Venkatesh Saligrama},\n  title        = {Outlier detection via localized p-value estimation},\n  booktitle    = {47th Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009},\n  pages        = {1482--1489},\n  year         = {2009},\n  crossref     = {DBLP:conf/allerton/2009},\n  url          = {https://doi.org/10.1109/ALLERTON.2009.5394501},\n  doi          = {10.1109/ALLERTON.2009.5394501},\n  timestamp    = {Sun, 17 Dec 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/allerton/ZhaoS09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Abnormal events detection based on spatio-temporal co-occurences.\n \n \n \n \n\n\n \n Benezeth, Y.; Jodoin, P.; Saligrama, V.; and Rosenberger, C.\n\n\n \n\n\n\n In 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2009), 20-25 June 2009, Miami, Florida, USA, pages 2458–2465, 2009. \n \n\n\n\n
\n\n\n\n \n \n $\"Abnormal$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cvpr/BenezethJSR09,\n  author       = {Yannick Benezeth and\n                  Pierre{-}Marc Jodoin and\n                  Venkatesh Saligrama and\n                  Christophe Rosenberger},\n  title        = {Abnormal events detection based on spatio-temporal co-occurences},\n  booktitle    = {2009 {IEEE} Computer Society Conference on Computer Vision and Pattern\n                  Recognition {(CVPR} 2009), 20-25 June 2009, Miami, Florida, {USA}},\n  pages        = {2458--2465},\n  year         = {2009},\n  crossref     = {DBLP:conf/cvpr/2009},\n  url          = {https://doi.org/10.1109/CVPR.2009.5206686},\n  doi          = {10.1109/CVPR.2009.5206686},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cvpr/BenezethJSR09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Unsupervised camera network structure estimation based on activity.\n \n \n \n \n\n\n \n Clarot, P.; Ermis, E. B.; Jodoin, P.; and Saligrama, V.\n\n\n \n\n\n\n In Third ACM/IEEE International Conference on Distributed Smart Cameras, ICDSC 2009, Como, Italy, August 30 - September 2, 2009, pages 1–8, 2009. \n \n\n\n\n
\n\n\n\n \n \n $\"Unsupervised$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icdsc/ClarotEJS09,\n  author       = {Pierre Clarot and\n                  Erhan Baki Ermis and\n                  Pierre{-}Marc Jodoin and\n                  Venkatesh Saligrama},\n  title        = {Unsupervised camera network structure estimation based on activity},\n  booktitle    = {Third {ACM/IEEE} International Conference on Distributed Smart Cameras,\n                  {ICDSC} 2009, Como, Italy, August 30 - September 2, 2009},\n  pages        = {1--8},\n  year         = {2009},\n  crossref     = {DBLP:conf/icdsc/2009},\n  url          = {https://doi.org/10.1109/ICDSC.2009.5289362},\n  doi          = {10.1109/ICDSC.2009.5289362},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icdsc/ClarotEJS09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Implicit Active-Contouring with MRF.\n \n \n \n \n\n\n \n Jodoin, P.; Saligrama, V.; and Konrad, J.\n\n\n \n\n\n\n In Image Analysis and Recognition, 6th International Conference, ICIAR 2009, Halifax, Canada, July 6-8, 2009. Proceedings, pages 178–190, 2009. \n \n\n\n\n
\n\n\n\n \n \n $\"Implicit$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/iciar/JodoinSK09,\n  author       = {Pierre{-}Marc Jodoin and\n                  Venkatesh Saligrama and\n                  Janusz Konrad},\n  title        = {Implicit Active-Contouring with {MRF}},\n  booktitle    = {Image Analysis and Recognition, 6th International Conference, {ICIAR}\n                  2009, Halifax, Canada, July 6-8, 2009. Proceedings},\n  pages        = {178--190},\n  year         = {2009},\n  crossref     = {DBLP:conf/iciar/2009},\n  url          = {https://doi.org/10.1007/978-3-642-02611-9\\_18},\n  doi          = {10.1007/978-3-642-02611-9\\_18},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iciar/JodoinSK09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Anomaly Detection with Score functions based on Nearest Neighbor Graphs.\n \n \n \n \n\n\n \n Zhao, M.; and Saligrama, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, Vancouver, British Columbia, Canada, pages 2250–2258, 2009. \n \n\n\n\n
\n\n\n\n \n \n $\"Anomaly$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/nips/ZhaoS09,\n  author       = {Manqi Zhao and\n                  Venkatesh Saligrama},\n  title        = {Anomaly Detection with Score functions based on Nearest Neighbor Graphs},\n  booktitle    = {Advances in Neural Information Processing Systems 22: 23rd Annual\n                  Conference on Neural Information Processing Systems 2009. Proceedings\n                  of a meeting held 7-10 December 2009, Vancouver, British Columbia,\n                  Canada},\n  pages        = {2250--2258},\n  year         = {2009},\n  crossref     = {DBLP:conf/nips/2009},\n  url          = {https://proceedings.neurips.cc/paper/2009/hash/996a7fa078cc36c46d02f9af3bef918b-Abstract.html},\n  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/nips/ZhaoS09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Boolean Compressed Sensing and Noisy Group Testing.\n \n \n \n \n\n\n \n Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/0907.1061. 2009.\n \n\n\n\n
\n\n\n\n \n \n $\"Boolean$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-0907-1061,\n  author       = {George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {Boolean Compressed Sensing and Noisy Group Testing},\n  journal      = {CoRR},\n  volume       = {abs/0907.1061},\n  year         = {2009},\n  url          = {http://arxiv.org/abs/0907.1061},\n  eprinttype    = {arXiv},\n  eprint       = {0907.1061},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0907-1061.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Compressed Blind De-convolution.\n \n \n \n \n\n\n \n Saligrama, V.; and Zhao, M.\n\n\n \n\n\n\n CoRR, abs/0910.0239. 2009.\n \n\n\n\n
\n\n\n\n \n \n $\"Compressed$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-0910-0239,\n  author       = {Venkatesh Saligrama and\n                  Manqi Zhao},\n  title        = {Compressed Blind De-convolution},\n  journal      = {CoRR},\n  volume       = {abs/0910.0239},\n  year         = {2009},\n  url          = {http://arxiv.org/abs/0910.0239},\n  eprinttype    = {arXiv},\n  eprint       = {0910.0239},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0910-0239.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Behavior Subtraction.\n \n \n \n \n\n\n \n Jodoin, P.; Saligrama, V.; and Konrad, J.\n\n\n \n\n\n\n CoRR, abs/0910.2917. 2009.\n \n\n\n\n
\n\n\n\n \n \n $\"Behavior$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-0910-2917,\n  author       = {Pierre{-}Marc Jodoin and\n                  Venkatesh Saligrama and\n                  Janusz Konrad},\n  title        = {Behavior Subtraction},\n  journal      = {CoRR},\n  volume       = {abs/0910.2917},\n  year         = {2009},\n  url          = {http://arxiv.org/abs/0910.2917},\n  eprinttype    = {arXiv},\n  eprint       = {0910.2917},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0910-2917.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Anomaly Detection with Score functions based on Nearest Neighbor Graphs.\n \n \n \n \n\n\n \n Zhao, M.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/0910.5461. 2009.\n \n\n\n\n
\n\n\n\n \n \n $\"Anomaly$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-0910-5461,\n  author       = {Manqi Zhao and\n                  Venkatesh Saligrama},\n  title        = {Anomaly Detection with Score functions based on Nearest Neighbor Graphs},\n  journal      = {CoRR},\n  volume       = {abs/0910.5461},\n  year         = {2009},\n  url          = {http://arxiv.org/abs/0910.5461},\n  eprinttype    = {arXiv},\n  eprint       = {0910.5461},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0910-5461.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2008\n \n \n (14)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Efficient Sensor Management Policies for Distributed Target Tracking in Multihop Sensor Networks.\n \n \n \n \n\n\n \n Aeron, S.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n IEEE Trans. Signal Process., 56(6): 2562–2574. 2008.\n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tsp/AeronSC08,\n  author       = {Shuchin Aeron and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Efficient Sensor Management Policies for Distributed Target Tracking\n                  in Multihop Sensor Networks},\n  journal      = {{IEEE} Trans. Signal Process.},\n  volume       = {56},\n  number       = {6},\n  pages        = {2562--2574},\n  year         = {2008},\n  url          = {https://doi.org/10.1109/TSP.2007.912891},\n  doi          = {10.1109/TSP.2007.912891},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tsp/AeronSC08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n One-Bit Distributed Sensing and Coding for Field Estimation in Sensor Networks.\n \n \n \n \n\n\n \n Wang, Y.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Signal Process., 56(9): 4433–4445. 2008.\n \n\n\n\n
\n\n\n\n \n \n $\"One-Bit$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tsp/WangIS08,\n  author       = {Ye Wang and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {One-Bit Distributed Sensing and Coding for Field Estimation in Sensor\n                  Networks},\n  journal      = {{IEEE} Trans. Signal Process.},\n  volume       = {56},\n  number       = {9},\n  pages        = {4433--4445},\n  year         = {2008},\n  url          = {https://doi.org/10.1109/TSP.2008.926192},\n  doi          = {10.1109/TSP.2008.926192},\n  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tsp/WangIS08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Codes to unmask spectrum violators in cognitive radio systems.\n \n \n \n \n\n\n \n Atia, G. K.; Saligrama, V.; and Sahai, A.\n\n\n \n\n\n\n In 42nd Asilomar Conference on Signals, Systems and Computers, ACSSC 2008, Pacific Grove, CA, USA, October 26-29, 2008, pages 1574–1578, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Codes$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/acssc/AtiaSS08,\n  author       = {George K. Atia and\n                  Venkatesh Saligrama and\n                  Anant Sahai},\n  title        = {Codes to unmask spectrum violators in cognitive radio systems},\n  booktitle    = {42nd Asilomar Conference on Signals, Systems and Computers, {ACSSC}\n                  2008, Pacific Grove, CA, USA, October 26-29, 2008},\n  pages        = {1574--1578},\n  year         = {2008},\n  crossref     = {DBLP:conf/acssc/2008},\n  url          = {https://doi.org/10.1109/ACSSC.2008.5074687},\n  doi          = {10.1109/ACSSC.2008.5074687},\n  timestamp    = {Sun, 12 Feb 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/acssc/AtiaSS08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Crime and Punishment for Cognitive Radios.\n \n \n \n \n\n\n \n Woyach, K. A.; Sahai, A.; Atia, G. K.; and Saligrama, V.\n\n\n \n\n\n\n In 46th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2008, Monticello, IL, USA, September 24-26, 2008, pages 236–243, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Crime$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/allerton/WoyachSAS08,\n  author       = {Kristen Ann Woyach and\n                  Anant Sahai and\n                  George K. Atia and\n                  Venkatesh Saligrama},\n  title        = {Crime and Punishment for Cognitive Radios},\n  booktitle    = {46th Annual Allerton Conference on Communication, Control, and Computing,\n                  Allerton 2008, Monticello, IL, USA, September 24-26, 2008},\n  pages        = {236--243},\n  year         = {2008},\n  crossref     = {DBLP:conf/allerton/2008},\n  url          = {https://doi.org/10.1109/ALLERTON.2008.4797562},\n  doi          = {10.1109/ALLERTON.2008.4797562},\n  timestamp    = {Sun, 17 Dec 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/allerton/WoyachSAS08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On Throughput Maximization and Interference Avoidance in Cognitive Radios.\n \n \n \n \n\n\n \n Atia, G. K.; Aeron, S.; Ermis, E. B.; and Saligrama, V.\n\n\n \n\n\n\n In 5th IEEE Consumer Communications and Networking Conference, CCNC 2008, Las Vegas, NV, USA, January 10-12, 2008, pages 963–967, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ccnc/AtiaAES08,\n  author       = {George K. Atia and\n                  Shuchin Aeron and\n                  Erhan Baki Ermis and\n                  Venkatesh Saligrama},\n  title        = {On Throughput Maximization and Interference Avoidance in Cognitive\n                  Radios},\n  booktitle    = {5th {IEEE} Consumer Communications and Networking Conference, {CCNC}\n                  2008, Las Vegas, NV, USA, January 10-12, 2008},\n  pages        = {963--967},\n  year         = {2008},\n  crossref     = {DBLP:conf/ccnc/2008},\n  url          = {https://doi.org/10.1109/ccnc08.2007.222},\n  doi          = {10.1109/CCNC08.2007.222},\n  timestamp    = {Mon, 09 Aug 2021 14:54:01 +0200},\n  biburl       = {https://dblp.org/rec/conf/ccnc/AtiaAES08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Abnormal behavior detection and behavior matching for networked cameras.\n \n \n \n \n\n\n \n Ermis, E. B.; Saligrama, V.; Jodoin, P.; and Konrad, J.\n\n\n \n\n\n\n In 2008 Second ACM/IEEE International Conference on Distributed Smart Cameras, Stanford, CA, USA, September 7-11, 2008, pages 1–10, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Abnormal$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icdsc/ErmisSJK08,\n  author       = {Erhan Baki Ermis and\n                  Venkatesh Saligrama and\n                  Pierre{-}Marc Jodoin and\n                  Janusz Konrad},\n  title        = {Abnormal behavior detection and behavior matching for networked cameras},\n  booktitle    = {2008 Second {ACM/IEEE} International Conference on Distributed Smart\n                  Cameras, Stanford, CA, USA, September 7-11, 2008},\n  pages        = {1--10},\n  year         = {2008},\n  crossref     = {DBLP:conf/icdsc/2008},\n  url          = {https://doi.org/10.1109/ICDSC.2008.4635728},\n  doi          = {10.1109/ICDSC.2008.4635728},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icdsc/ErmisSJK08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Modeling background activity for behavior subtraction.\n \n \n \n \n\n\n \n Jodoin, P.; Konrad, J.; and Saligrama, V.\n\n\n \n\n\n\n In 2008 Second ACM/IEEE International Conference on Distributed Smart Cameras, Stanford, CA, USA, September 7-11, 2008, pages 1–10, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Modeling$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icdsc/JodoinKS08,\n  author       = {Pierre{-}Marc Jodoin and\n                  Janusz Konrad and\n                  Venkatesh Saligrama},\n  title        = {Modeling background activity for behavior subtraction},\n  booktitle    = {2008 Second {ACM/IEEE} International Conference on Distributed Smart\n                  Cameras, Stanford, CA, USA, September 7-11, 2008},\n  pages        = {1--10},\n  year         = {2008},\n  crossref     = {DBLP:conf/icdsc/2008},\n  url          = {https://doi.org/10.1109/ICDSC.2008.4635683},\n  doi          = {10.1109/ICDSC.2008.4635683},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icdsc/JodoinKS08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Motion detection with an unstable camera.\n \n \n \n \n\n\n \n Jodoin, P.; Konrad, J.; Saligrama, V.; and Veilleux-Gaboury, V.\n\n\n \n\n\n\n In Proceedings of the International Conference on Image Processing, ICIP 2008, October 12-15, 2008, San Diego, California, USA, pages 229–232, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Motion$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icip/JodoinKSV08,\n  author       = {Pierre{-}Marc Jodoin and\n                  Janusz Konrad and\n                  Venkatesh Saligrama and\n                  Vincent Veilleux{-}Gaboury},\n  title        = {Motion detection with an unstable camera},\n  booktitle    = {Proceedings of the International Conference on Image Processing, {ICIP}\n                  2008, October 12-15, 2008, San Diego, California, {USA}},\n  pages        = {229--232},\n  year         = {2008},\n  crossref     = {DBLP:conf/icip/2008},\n  url          = {https://doi.org/10.1109/ICIP.2008.4711733},\n  doi          = {10.1109/ICIP.2008.4711733},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icip/JodoinKSV08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Motion segmentation and abnormal behavior detection via behavior clustering.\n \n \n \n \n\n\n \n Ermis, E. B.; Saligrama, V.; Jodoin, P.; and Konrad, J.\n\n\n \n\n\n\n In Proceedings of the International Conference on Image Processing, ICIP 2008, October 12-15, 2008, San Diego, California, USA, pages 769–772, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Motion$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icip/ErmisSJK08,\n  author       = {Erhan Baki Ermis and\n                  Venkatesh Saligrama and\n                  Pierre{-}Marc Jodoin and\n                  Janusz Konrad},\n  title        = {Motion segmentation and abnormal behavior detection via behavior clustering},\n  booktitle    = {Proceedings of the International Conference on Image Processing, {ICIP}\n                  2008, October 12-15, 2008, San Diego, California, {USA}},\n  pages        = {769--772},\n  year         = {2008},\n  crossref     = {DBLP:conf/icip/2008},\n  url          = {https://doi.org/10.1109/ICIP.2008.4711868},\n  doi          = {10.1109/ICIP.2008.4711868},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icip/ErmisSJK08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Motion detection with false discovery rate control.\n \n \n \n \n\n\n \n McHugh, J. M.; Konrad, J.; Saligrama, V.; Jodoin, P.; and Castañón, D. A.\n\n\n \n\n\n\n In Proceedings of the International Conference on Image Processing, ICIP 2008, October 12-15, 2008, San Diego, California, USA, pages 873–876, 2008. \n \n\n\n\n
\n\n\n\n \n \n $\"Motion$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icip/McHughKSJC08,\n  author       = {J. Mike McHugh and\n                  Janusz Konrad and\n                  Venkatesh Saligrama and\n                  Pierre{-}Marc Jodoin and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Motion detection with false discovery rate control},\n  booktitle    = {Proceedings of the International Conference on Image Processing, {ICIP}\n                  2008, October 12-15, 2008, San Diego, California, {USA}},\n  pages        = {873--876},\n  year         = {2008},\n  crossref     = {DBLP:conf/icip/2008},\n  url          = {https://doi.org/10.1109/ICIP.2008.4711894},\n  doi          = {10.1109/ICIP.2008.4711894},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icip/McHughKSJC08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Fundamental Limits on Sensing Capacity for Sensor Networks and Compressed Sensing.\n \n \n \n \n\n\n \n Aeron, S.; Zhao, M.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/0804.3439. 2008.\n \n\n\n\n
\n\n\n\n \n \n $\"Fundamental$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-0804-3439,\n  author       = {Shuchin Aeron and\n                  Manqi Zhao and\n                  Venkatesh Saligrama},\n  title        = {Fundamental Limits on Sensing Capacity for Sensor Networks and Compressed\n                  Sensing},\n  journal      = {CoRR},\n  volume       = {abs/0804.3439},\n  year         = {2008},\n  url          = {http://arxiv.org/abs/0804.3439},\n  eprinttype    = {arXiv},\n  eprint       = {0804.3439},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0804-3439.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Deterministic Designs with Deterministic Guarantees: Toeplitz Compressed Sensing Matrices, Sequence Designs and System Identification.\n \n \n \n \n\n\n \n Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/0806.4958. 2008.\n \n\n\n\n
\n\n\n\n \n \n $\"Deterministic$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-0806-4958,\n  author       = {Venkatesh Saligrama},\n  title        = {Deterministic Designs with Deterministic Guarantees: Toeplitz Compressed\n                  Sensing Matrices, Sequence Designs and System Identification},\n  journal      = {CoRR},\n  volume       = {abs/0806.4958},\n  year         = {2008},\n  url          = {http://arxiv.org/abs/0806.4958},\n  eprinttype    = {arXiv},\n  eprint       = {0806.4958},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0806-4958.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Distributed Detection in Sensor Networks with Limited Range Multi-Modal Sensors.\n \n \n \n \n\n\n \n Ermis, E. B.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/0809.1900. 2008.\n \n\n\n\n
\n\n\n\n \n \n $\"Distributed$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-0809-1900,\n  author       = {Erhan Baki Ermis and\n                  Venkatesh Saligrama},\n  title        = {Distributed Detection in Sensor Networks with Limited Range Multi-Modal\n                  Sensors},\n  journal      = {CoRR},\n  volume       = {abs/0809.1900},\n  year         = {2008},\n  url          = {http://arxiv.org/abs/0809.1900},\n  eprinttype    = {arXiv},\n  eprint       = {0809.1900},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0809-1900.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Thresholded Basis Pursuit: Quantizing Linear Programming Solutions for Optimal Support Recovery and Approximation in Compressed Sensing.\n \n \n \n \n\n\n \n Saligrama, V.; and Zhao, M.\n\n\n \n\n\n\n CoRR, abs/0809.4883. 2008.\n \n\n\n\n
\n\n\n\n \n \n $\"Thresholded$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-0809-4883,\n  author       = {Venkatesh Saligrama and\n                  Manqi Zhao},\n  title        = {Thresholded Basis Pursuit: Quantizing Linear Programming Solutions\n                  for Optimal Support Recovery and Approximation in Compressed Sensing},\n  journal      = {CoRR},\n  volume       = {abs/0809.4883},\n  year         = {2008},\n  url          = {http://arxiv.org/abs/0809.4883},\n  eprinttype    = {arXiv},\n  eprint       = {0809.4883},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0809-4883.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2007\n \n \n (7)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime.\n \n \n \n \n\n\n \n Aeron, S.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 53(6): 2044–2059. 2007.\n \n\n\n\n
\n\n\n\n \n \n $\"Wireless$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/AeronS07,\n  author       = {Shuchin Aeron and\n                  Venkatesh Saligrama},\n  title        = {Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed\n                  {SNR} Regime},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {53},\n  number       = {6},\n  pages        = {2044--2059},\n  year         = {2007},\n  url          = {https://doi.org/10.1109/TIT.2007.896858},\n  doi          = {10.1109/TIT.2007.896858},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/AeronS07.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On Optimal Outage in Relay Channels With General Fading Distributions.\n \n \n \n \n\n\n \n Atia, G. K.; Sharif, M.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Inf. Theory, 53(10): 3786–3797. 2007.\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tit/AtiaSS07,\n  author       = {George K. Atia and\n                  Masoud Sharif and\n                  Venkatesh Saligrama},\n  title        = {On Optimal Outage in Relay Channels With General Fading Distributions},\n  journal      = {{IEEE} Trans. Inf. Theory},\n  volume       = {53},\n  number       = {10},\n  pages        = {3786--3797},\n  year         = {2007},\n  url          = {https://doi.org/10.1109/TIT.2007.904965},\n  doi          = {10.1109/TIT.2007.904965},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tit/AtiaSS07.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Distributed Tracking in Multihop Sensor Networks With Communication Delays.\n \n \n \n \n\n\n \n Rahman, R.; Alanyali, M.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Trans. Signal Process., 55(9): 4656–4668. 2007.\n \n\n\n\n
\n\n\n\n \n \n $\"Distributed$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tsp/RahmanAS07,\n  author       = {R. Rahman and\n                  Murat Alanyali and\n                  Venkatesh Saligrama},\n  title        = {Distributed Tracking in Multihop Sensor Networks With Communication\n                  Delays},\n  journal      = {{IEEE} Trans. Signal Process.},\n  volume       = {55},\n  number       = {9},\n  pages        = {4656--4668},\n  year         = {2007},\n  url          = {https://doi.org/10.1109/TSP.2007.896272},\n  doi          = {10.1109/TSP.2007.896272},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tsp/RahmanAS07.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Robust Distributed Detection with Limited Range Sensors.\n \n \n \n \n\n\n \n Ermis, E. B.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2007, Honolulu, Hawaii, USA, April 15-20, 2007, pages 1009–1012, 2007. \n \n\n\n\n
\n\n\n\n \n \n $\"Robust$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/ErmisS07,\n  author       = {Erhan Baki Ermis and\n                  Venkatesh Saligrama},\n  title        = {Robust Distributed Detection with Limited Range Sensors},\n  booktitle    = {Proceedings of the {IEEE} International Conference on Acoustics, Speech,\n                  and Signal Processing, {ICASSP} 2007, Honolulu, Hawaii, USA, April\n                  15-20, 2007},\n  pages        = {1009--1012},\n  year         = {2007},\n  crossref     = {DBLP:conf/icassp/2007},\n  url          = {https://doi.org/10.1109/ICASSP.2007.366409},\n  doi          = {10.1109/ICASSP.2007.366409},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/ErmisS07.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On sensing capacity of sensor networks for the class of linear observation, fixed SNR models.\n \n \n \n \n\n\n \n Aeron, S.; Zhao, M.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/0704.3434. 2007.\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-0704-3434,\n  author       = {Shuchin Aeron and\n                  Manqi Zhao and\n                  Venkatesh Saligrama},\n  title        = {On sensing capacity of sensor networks for the class of linear observation,\n                  fixed {SNR} models},\n  journal      = {CoRR},\n  volume       = {abs/0704.3434},\n  year         = {2007},\n  url          = {http://arxiv.org/abs/0704.3434},\n  eprinttype    = {arXiv},\n  eprint       = {0704.3434},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0704-3434.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Distributed Detection in Sensor Networks with Limited Range Sensors.\n \n \n \n \n\n\n \n Ermis, E. B.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/cs/0701178. 2007.\n \n\n\n\n
\n\n\n\n \n \n $\"Distributed$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-cs-0701178,\n  author       = {Erhan Baki Ermis and\n                  Venkatesh Saligrama},\n  title        = {Distributed Detection in Sensor Networks with Limited Range Sensors},\n  journal      = {CoRR},\n  volume       = {abs/cs/0701178},\n  year         = {2007},\n  url          = {http://arxiv.org/abs/cs/0701178},\n  eprinttype    = {arXiv},\n  eprint       = {cs/0701178},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0701178.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n One-bit Distributed Sensing and Coding for Field Estimation in Sensor Networks.\n \n \n \n \n\n\n \n Wang, Y.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/cs/0701196. 2007.\n \n\n\n\n
\n\n\n\n \n \n $\"One-bit$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-cs-0701196,\n  author       = {Ye Wang and\n                  Prakash Ishwar and\n                  Venkatesh Saligrama},\n  title        = {One-bit Distributed Sensing and Coding for Field Estimation in Sensor\n                  Networks},\n  journal      = {CoRR},\n  volume       = {abs/cs/0701196},\n  year         = {2007},\n  url          = {http://arxiv.org/abs/cs/0701196},\n  eprinttype    = {arXiv},\n  eprint       = {cs/0701196},\n  timestamp    = {Thu, 17 Oct 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0701196.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2006\n \n \n (12)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Search and discovery in an uncertain networked world.\n \n \n \n \n\n\n \n Ermis, E. B.; Alanyali, M.; and Saligrama, V.\n\n\n \n\n\n\n IEEE Signal Process. Mag., 23(4): 107–118. 2006.\n \n\n\n\n
\n\n\n\n \n \n $\"Search$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/spm/ErmisAS06,\n  author       = {Erhan Baki Ermis and\n                  Murat Alanyali and\n                  Venkatesh Saligrama},\n  title        = {Search and discovery in an uncertain networked world},\n  journal      = {{IEEE} Signal Process. Mag.},\n  volume       = {23},\n  number       = {4},\n  pages        = {107--118},\n  year         = {2006},\n  url          = {https://doi.org/10.1109/MSP.2006.1657821},\n  doi          = {10.1109/MSP.2006.1657821},\n  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/spm/ErmisAS06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Distributed Detection in Sensor Networks With Packet Losses and Finite Capacity Links.\n \n \n \n \n\n\n \n Saligrama, V.; Alanyali, M.; and Savas, O.\n\n\n \n\n\n\n IEEE Trans. Signal Process., 54(11): 4118–4132. 2006.\n \n\n\n\n
\n\n\n\n \n \n $\"Distributed$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tsp/SaligramaAS06,\n  author       = {Venkatesh Saligrama and\n                  Murat Alanyali and\n                  Onur Savas},\n  title        = {Distributed Detection in Sensor Networks With Packet Losses and Finite\n                  Capacity Links},\n  journal      = {{IEEE} Trans. Signal Process.},\n  volume       = {54},\n  number       = {11},\n  pages        = {4118--4132},\n  year         = {2006},\n  url          = {https://doi.org/10.1109/TSP.2006.880227},\n  doi          = {10.1109/TSP.2006.880227},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tsp/SaligramaAS06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Energy Efficient Policies for Distributed Target Tracking in Multihop Sensor Networks.\n \n \n \n \n\n\n \n Aeron, S.; Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n In 45th IEEE Conference on Decision and Control, CDC 2006, San Diego, CA, USA, December 13-15, 2006, pages 380–385, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"Energy$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cdc/AeronSC06,\n  author       = {Shuchin Aeron and\n                  Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Energy Efficient Policies for Distributed Target Tracking in Multihop\n                  Sensor Networks},\n  booktitle    = {45th {IEEE} Conference on Decision and Control, {CDC} 2006, San Diego,\n                  CA, USA, December 13-15, 2006},\n  pages        = {380--385},\n  year         = {2006},\n  crossref     = {DBLP:conf/cdc/2006},\n  url          = {https://doi.org/10.1109/CDC.2006.376724},\n  doi          = {10.1109/CDC.2006.376724},\n  timestamp    = {Fri, 04 Mar 2022 13:26:30 +0100},\n  biburl       = {https://dblp.org/rec/conf/cdc/AeronSC06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Reliable Distributed Estimation with Intermittent Communications.\n \n \n \n \n\n\n \n Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n In 45th IEEE Conference on Decision and Control, CDC 2006, San Diego, CA, USA, December 13-15, 2006, pages 6763–6768, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"Reliable$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cdc/SaligramaC06,\n  author       = {Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Reliable Distributed Estimation with Intermittent Communications},\n  booktitle    = {45th {IEEE} Conference on Decision and Control, {CDC} 2006, San Diego,\n                  CA, USA, December 13-15, 2006},\n  pages        = {6763--6768},\n  year         = {2006},\n  crossref     = {DBLP:conf/cdc/2006},\n  url          = {https://doi.org/10.1109/CDC.2006.377646},\n  doi          = {10.1109/CDC.2006.377646},\n  timestamp    = {Wed, 08 Jul 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/cdc/SaligramaC06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Randomized Sequential Algorithms for Data Aggregation in Sensor Networks.\n \n \n \n \n\n\n \n Savas, O.; Alanyali, M.; and Saligrama, V.\n\n\n \n\n\n\n In 40th Annual Conference on Information Sciences and Systems, CISS 2006, Princeton, NJ, USA, 22-24 March 2006, pages 165–170, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"Randomized$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ciss/SavasAS06,\n  author       = {Onur Savas and\n                  Murat Alanyali and\n                  Venkatesh Saligrama},\n  title        = {Randomized Sequential Algorithms for Data Aggregation in Sensor Networks},\n  booktitle    = {40th Annual Conference on Information Sciences and Systems, {CISS}\n                  2006, Princeton, NJ, USA, 22-24 March 2006},\n  pages        = {165--170},\n  year         = {2006},\n  crossref     = {DBLP:conf/ciss/2006},\n  url          = {https://doi.org/10.1109/CISS.2006.286455},\n  doi          = {10.1109/CISS.2006.286455},\n  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ciss/SavasAS06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Detection and Localization in Sensor Networks Using Distributed FDR.\n \n \n \n \n\n\n \n Ermis, E. B.; and Saligrama, V.\n\n\n \n\n\n\n In 40th Annual Conference on Information Sciences and Systems, CISS 2006, Princeton, NJ, USA, 22-24 March 2006, pages 699–704, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"Detection$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ciss/ErmisS06,\n  author       = {Erhan Baki Ermis and\n                  Venkatesh Saligrama},\n  title        = {Detection and Localization in Sensor Networks Using Distributed {FDR}},\n  booktitle    = {40th Annual Conference on Information Sciences and Systems, {CISS}\n                  2006, Princeton, NJ, USA, 22-24 March 2006},\n  pages        = {699--704},\n  year         = {2006},\n  crossref     = {DBLP:conf/ciss/2006},\n  url          = {https://doi.org/10.1109/CISS.2006.286557},\n  doi          = {10.1109/CISS.2006.286557},\n  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ciss/ErmisS06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Distributed Target tracking and localization in multi-hop networks.\n \n \n \n \n\n\n \n Aeron, S.; Saligrama, V.; and Castanon, D.\n\n\n \n\n\n\n In 40th Annual Conference on Information Sciences and Systems, CISS 2006, Princeton, NJ, USA, 22-24 March 2006, pages 990–995, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"Distributed$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ciss/AeronSC06,\n  author       = {Shuchin Aeron and\n                  Venkatesh Saligrama and\n                  David Castanon},\n  title        = {Distributed Target tracking and localization in multi-hop networks},\n  booktitle    = {40th Annual Conference on Information Sciences and Systems, {CISS}\n                  2006, Princeton, NJ, USA, 22-24 March 2006},\n  pages        = {990--995},\n  year         = {2006},\n  crossref     = {DBLP:conf/ciss/2006},\n  url          = {https://doi.org/10.1109/CISS.2006.286610},\n  doi          = {10.1109/CISS.2006.286610},\n  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ciss/AeronSC06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence.\n \n \n \n \n\n\n \n Savas, O.; Alanyali, M.; and Saligrama, V.\n\n\n \n\n\n\n In Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings, pages 252–265, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/dcoss/SavasAS06,\n  author       = {Onur Savas and\n                  Murat Alanyali and\n                  Venkatesh Saligrama},\n  title        = {Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence},\n  booktitle    = {Distributed Computing in Sensor Systems, Second {IEEE} International\n                  Conference, {DCOSS} 2006, San Francisco, CA, USA, June 18-20, 2006,\n                  Proceedings},\n  pages        = {252--265},\n  year         = {2006},\n  crossref     = {DBLP:conf/dcoss/2006},\n  url          = {https://doi.org/10.1007/11776178\\_16},\n  doi          = {10.1007/11776178\\_16},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/dcoss/SavasAS06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Effect of Geometry on the Diversity-Multiplexing Tradeoff in Relay Channels.\n \n \n \n \n\n\n \n Atia, G. K.; Sharif, M.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November - 1 December 2006, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"Effect$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/globecom/AtiaSS06,\n  author       = {George K. Atia and\n                  Masoud Sharif and\n                  Venkatesh Saligrama},\n  title        = {Effect of Geometry on the Diversity-Multiplexing Tradeoff in Relay\n                  Channels},\n  booktitle    = {Proceedings of the Global Telecommunications Conference, 2006. {GLOBECOM}\n                  '06, San Francisco, CA, USA, 27 November - 1 December 2006},\n  year         = {2006},\n  crossref     = {DBLP:conf/globecom/2006},\n  url          = {https://doi.org/10.1109/GLOCOM.2006.61},\n  doi          = {10.1109/GLOCOM.2006.61},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/globecom/AtiaSS06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Reliable Tracking With Intermittent Communications.\n \n \n \n \n\n\n \n Saligrama, V.; and Castañón, D. A.\n\n\n \n\n\n\n In 2006 IEEE International Conference on Acoustics Speech and Signal Processing, ICASSP 2006, Toulouse, France, May 14-19, 2006, pages 1141–1144, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"Reliable$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/SaligramaC06,\n  author       = {Venkatesh Saligrama and\n                  David A. Casta{\\~{n}}{\\'{o}}n},\n  title        = {Reliable Tracking With Intermittent Communications},\n  booktitle    = {2006 {IEEE} International Conference on Acoustics Speech and Signal\n                  Processing, {ICASSP} 2006, Toulouse, France, May 14-19, 2006},\n  pages        = {1141--1144},\n  year         = {2006},\n  crossref     = {DBLP:conf/icassp/2006},\n  url          = {https://doi.org/10.1109/ICASSP.2006.1661482},\n  doi          = {10.1109/ICASSP.2006.1661482},\n  timestamp    = {Mon, 22 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/SaligramaC06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On the macroscopic effects of local interactions in multi-hop wireless networks.\n \n \n \n \n\n\n \n Saligrama, V.; and Starobinski, D.\n\n\n \n\n\n\n In 4th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2006), 3-6 April 2006, Boston, Massachusetts, USA, pages 161–168, 2006. \n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/wiopt/SaligramaS06,\n  author       = {Venkatesh Saligrama and\n                  David Starobinski},\n  title        = {On the macroscopic effects of local interactions in multi-hop wireless\n                  networks},\n  booktitle    = {4th International Symposium on Modeling and Optimization in Mobile,\n                  Ad-Hoc and Wireless Networks (WiOpt 2006), 3-6 April 2006, Boston,\n                  Massachusetts, {USA}},\n  pages        = {161--168},\n  year         = {2006},\n  crossref     = {DBLP:conf/wiopt/2006},\n  url          = {https://doi.org/10.1109/WIOPT.2006.1666482},\n  doi          = {10.1109/WIOPT.2006.1666482},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/wiopt/SaligramaS06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Wireless ad-hoc networks: Strategies and Scaling laws for the fixed SNR regime.\n \n \n \n \n\n\n \n Aeron, S.; and Saligrama, V.\n\n\n \n\n\n\n CoRR, abs/cs/0608089. 2006.\n \n\n\n\n
\n\n\n\n \n \n $\"Wireless$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-cs-0608089,\n  author       = {Shuchin Aeron and\n                  Venkatesh Saligrama},\n  title        = {Wireless ad-hoc networks: Strategies and Scaling laws for the fixed\n                  {SNR} regime},\n  journal      = {CoRR},\n  volume       = {abs/cs/0608089},\n  year         = {2006},\n  url          = {http://arxiv.org/abs/cs/0608089},\n  eprinttype    = {arXiv},\n  eprint       = {cs/0608089},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0608089.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2005\n \n \n (2)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Adaptive statistical sampling methods for decentralized estimation and detection of localized phenomena.\n \n \n \n \n\n\n \n Ermis, E. B.; and Saligrama, V.\n\n\n \n\n\n\n In 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '05, Philadelphia, Pennsylvania, USA, March 18-23, 2005, pages 1045–1048, 2005. \n \n\n\n\n
\n\n\n\n \n \n $\"Adaptive$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/ErmisS05,\n  author       = {Erhan Baki Ermis and\n                  Venkatesh Saligrama},\n  title        = {Adaptive statistical sampling methods for decentralized estimation\n                  and detection of localized phenomena},\n  booktitle    = {2005 {IEEE} International Conference on Acoustics, Speech, and Signal\n                  Processing, {ICASSP} '05, Philadelphia, Pennsylvania, USA, March 18-23,\n                  2005},\n  pages        = {1045--1048},\n  year         = {2005},\n  crossref     = {DBLP:conf/icassp/2005},\n  url          = {https://doi.org/10.1109/ICASSP.2005.1416486},\n  doi          = {10.1109/ICASSP.2005.1416486},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/ErmisS05.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Adaptive statistical sampling methods for decentralized estimation and detection of localized phenomena.\n \n \n \n \n\n\n \n Ermis, E. B.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, IPSN 2005, April 25-27, 2005, UCLA, Los Angeles, California, USA, pages 143–150, 2005. \n \n\n\n\n
\n\n\n\n \n \n $\"Adaptive$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ipsn/ErmisS05,\n  author       = {Erhan Baki Ermis and\n                  Venkatesh Saligrama},\n  title        = {Adaptive statistical sampling methods for decentralized estimation\n                  and detection of localized phenomena},\n  booktitle    = {Proceedings of the Fourth International Symposium on Information Processing\n                  in Sensor Networks, {IPSN} 2005, April 25-27, 2005, UCLA, Los Angeles,\n                  California, {USA}},\n  pages        = {143--150},\n  year         = {2005},\n  crossref     = {DBLP:conf/ipsn/2005},\n  url          = {https://doi.org/10.1109/IPSN.2005.1440916},\n  doi          = {10.1109/IPSN.2005.1440916},\n  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ipsn/ErmisS05.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2004\n \n \n (5)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Necessary and sufficient conditions for robust identification of uncertain LTI systems.\n \n \n \n \n\n\n \n Saligrama, V.\n\n\n \n\n\n\n Syst. Control. Lett., 53(2): 117–125. 2004.\n \n\n\n\n
\n\n\n\n \n \n $\"Necessary$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/scl/Venkatesh04,\n  author       = {Venkatesh Saligrama},\n  title        = {Necessary and sufficient conditions for robust identification of uncertain\n                  {LTI} systems},\n  journal      = {Syst. Control. Lett.},\n  volume       = {53},\n  number       = {2},\n  pages        = {117--125},\n  year         = {2004},\n  url          = {https://doi.org/10.1016/j.sysconle.2003.10.007},\n  doi          = {10.1016/J.SYSCONLE.2003.10.007},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/scl/Venkatesh04.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Distributed Bayesian hypothesis testing in sensor networks.\n \n \n \n \n\n\n \n Alanyali, M.; Saligrama, V.; Savas, O.; and Aeron, S.\n\n\n \n\n\n\n In Proceedings of the 2004 American Control Conference, ACC 2004, Boston, MA, USA, June 30 - July 2, 2004, pages 5369–5374, 2004. \n \n\n\n\n
\n\n\n\n \n \n $\"Distributed$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/amcc/AlanyaliSSA04,\n  author       = {Murat Alanyali and\n                  Venkatesh Saligrama and\n                  Onur Savas and\n                  Shuchin Aeron},\n  title        = {Distributed Bayesian hypothesis testing in sensor networks},\n  booktitle    = {Proceedings of the 2004 American Control Conference, {ACC} 2004, Boston,\n                  MA, USA, June 30 - July 2, 2004},\n  pages        = {5369--5374},\n  year         = {2004},\n  crossref     = {DBLP:conf/amcc/2004},\n  url          = {https://doi.org/10.23919/ACC.2004.1384706},\n  doi          = {10.23919/ACC.2004.1384706},\n  timestamp    = {Thu, 24 Nov 2022 09:21:27 +0100},\n  biburl       = {https://dblp.org/rec/conf/amcc/AlanyaliSSA04.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Performance guarantees in sensor networks.\n \n \n \n \n\n\n \n Saligrama, V.; Shi, Y.; and Karl, W. C.\n\n\n \n\n\n\n In 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2004, Montreal, Quebec, Canada, May 17-21, 2004, pages 269–272, 2004. \n \n\n\n\n
\n\n\n\n \n \n $\"Performance$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icassp/SaligramaSK04,\n  author       = {Venkatesh Saligrama and\n                  Yonggang Shi and\n                  William Clement Karl},\n  title        = {Performance guarantees in sensor networks},\n  booktitle    = {2004 {IEEE} International Conference on Acoustics, Speech, and Signal\n                  Processing, {ICASSP} 2004, Montreal, Quebec, Canada, May 17-21, 2004},\n  pages        = {269--272},\n  year         = {2004},\n  crossref     = {DBLP:conf/icassp/2004},\n  url          = {https://doi.org/10.1109/ICASSP.2004.1326246},\n  doi          = {10.1109/ICASSP.2004.1326246},\n  timestamp    = {Mon, 22 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icassp/SaligramaSK04.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Classification in sensor networks.\n \n \n \n \n\n\n \n Saligrama, V.; Alanyali, M.; Savas, O.; and Aeron, S.\n\n\n \n\n\n\n In Proceedings of the 2004 IEEE International Symposium on Information Theory, ISIT 2004, Chicago Downtown Marriott, Chicago, Illinois, USA, June 27 - July 2, 2004, pages 251, 2004. \n \n\n\n\n
\n\n\n\n \n \n $\"Classification$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/isit/SaligramaASA04,\n  author       = {Venkatesh Saligrama and\n                  Murat Alanyali and\n                  Onur Savas and\n                  Shuchin Aeron},\n  title        = {Classification in sensor networks},\n  booktitle    = {Proceedings of the 2004 {IEEE} International Symposium on Information\n                  Theory, {ISIT} 2004, Chicago Downtown Marriott, Chicago, Illinois,\n                  USA, June 27 - July 2, 2004},\n  pages        = {251},\n  year         = {2004},\n  crossref     = {DBLP:conf/isit/2004},\n  url          = {https://doi.org/10.1109/ISIT.2004.1365289},\n  doi          = {10.1109/ISIT.2004.1365289},\n  timestamp    = {Wed, 16 Oct 2019 14:14:48 +0200},\n  biburl       = {https://dblp.org/rec/conf/isit/SaligramaASA04.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Capacity scaling in wireless ad-hoc networks with P\$_\\mboxe\$.\n \n \n \n \n\n\n \n Aeron, S.; and Saligrama, V.\n\n\n \n\n\n\n In Proceedings of the 2004 IEEE International Symposium on Information Theory, ISIT 2004, Chicago Downtown Marriott, Chicago, Illinois, USA, June 27 - July 2, 2004, pages 469, 2004. \n \n\n\n\n
\n\n\n\n \n \n $\"Capacity$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/isit/AeronS04,\n  author       = {Shuchin Aeron and\n                  Venkatesh Saligrama},\n  title        = {Capacity scaling in wireless ad-hoc networks with P\\({}_{\\mbox{e}}\\)},\n  booktitle    = {Proceedings of the 2004 {IEEE} International Symposium on Information\n                  Theory, {ISIT} 2004, Chicago Downtown Marriott, Chicago, Illinois,\n                  USA, June 27 - July 2, 2004},\n  pages        = {469},\n  year         = {2004},\n  crossref     = {DBLP:conf/isit/2004},\n  url          = {https://doi.org/10.1109/ISIT.2004.1365508},\n  doi          = {10.1109/ISIT.2004.1365508},\n  timestamp    = {Wed, 28 Jul 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/isit/AeronS04.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2003\n \n \n (1)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Identification of uncertain systems described by linear fractional transformations.\n \n \n \n \n\n\n \n Saligrama, V.\n\n\n \n\n\n\n In 42nd IEEE Conference on Decision and Control, CDC 2003, Maui, Hawaii, USA, December 9-12, 2003, pages 5532–5537, 2003. \n \n\n\n\n
\n\n\n\n \n \n $\"Identification$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cdc/Venkatesh03,\n  author       = {Venkatesh Saligrama},\n  title        = {Identification of uncertain systems described by linear fractional\n                  transformations},\n  booktitle    = {42nd {IEEE} Conference on Decision and Control, {CDC} 2003, Maui,\n                  Hawaii, USA, December 9-12, 2003},\n  pages        = {5532--5537},\n  year         = {2003},\n  crossref     = {DBLP:conf/cdc/2003},\n  url          = {https://doi.org/10.1109/CDC.2003.1272518},\n  doi          = {10.1109/CDC.2003.1272518},\n  timestamp    = {Tue, 19 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/cdc/Venkatesh03.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2001\n \n \n (1)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Dynamic inverse optimization.\n \n \n \n \n\n\n \n Gentry, S.; Saligrama, V.; and Feron, E.\n\n\n \n\n\n\n In American Control Conference, ACC 2001, Arlington, VA, USA, 25-27 June, 2001, pages 4722–4727, 2001. \n \n\n\n\n
\n\n\n\n \n \n $\"Dynamic$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/amcc/GentrySF01,\n  author       = {Sommer Gentry and\n                  Venkatesh Saligrama and\n                  Eric Feron},\n  title        = {Dynamic inverse optimization},\n  booktitle    = {American Control Conference, {ACC} 2001, Arlington, VA, USA, 25-27\n                  June, 2001},\n  pages        = {4722--4727},\n  year         = {2001},\n  crossref     = {DBLP:conf/amcc/2001},\n  url          = {https://doi.org/10.1109/ACC.2001.945728},\n  doi          = {10.1109/ACC.2001.945728},\n  timestamp    = {Wed, 05 Jan 2022 10:14:49 +0100},\n  biburl       = {https://dblp.org/rec/conf/amcc/GentrySF01.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n\n\n\n

\n\n\n \n\n \n \n \n \n\n