{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:01:19Z","timestamp":1725598879157},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006949","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"2348-2352","source":"Crossref","is-referenced-by-count":1,"title":["Information theoretic limits for linear prediction with graph-structured sparsity"],"prefix":"10.1109","author":[{"given":"Adarsh","family":"Barik","sequence":"first","affiliation":[]},{"given":"Jean","family":"Honorio","sequence":"additional","affiliation":[]},{"given":"Mohit","family":"Tawarmalani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"154","article-title":"One-bit compressed sensing: Provable support and vector recovery","author":"gopi","year":"2013","journal-title":"ICML"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.04.002"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191659"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513573"},{"journal-title":"Information theoretic limits for linear prediction with graph-structured sparsity","year":"2017","author":"barik","key":"ref15"},{"key":"ref4","article-title":"Subspace pursuit for compressive sensing: Closing the gap between performance and complexity","author":"dai","year":"2008","journal-title":"Technical report DTIC Document"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875152"},{"key":"ref2","first-page":"928","article-title":"A nearly-linear time framework for graph-structured sparsity","author":"hegde","year":"2015","journal-title":"Proceedings of the 32nd InternationalConference on Machine Learning (ICML-15)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040894"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513510"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006949.pdf?arnumber=8006949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T20:01:30Z","timestamp":1513195290000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006949\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006949","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}