{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:24:56Z","timestamp":1760171096591},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/globalsip.2018.8646569","type":"proceedings-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:33:06Z","timestamp":1552926786000},"page":"131-135","source":"Crossref","is-referenced-by-count":1,"title":["SKETCHING DISCRETE VALUED SPARSE MATRICES"],"prefix":"10.1109","author":[{"given":"Lakshmi Narasimhan","family":"Theagarajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146090"},{"key":"ref14","first-page":"2349","article-title":"Detection of sparse signals under finite-alphabet constraints","author":"tian","year":"2009","journal-title":"Proceedings of the International Conference on Acoustics Speech and Signal Processing (ICASSP)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.07.006"},{"key":"ref16","article-title":"Promp: A sparse recovery approach to lattice-valued signals","author":"flinth","year":"2017","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2307836"},{"journal-title":"Probabilistic Graphical Models Principles and Techniques","year":"2009","author":"koller","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/11\/P11008"},{"journal-title":"Large MIMO Systems","year":"2014","author":"chockalingam","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4_7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7509396"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.5464411"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009718"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2391251"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308"},{"article-title":"Recovery of sparse matrices via matrix sketching","year":"2013","author":"wimalajeewa","key":"ref9"},{"article-title":"Low-complexity iterative algorithms for (discrete) compressed sensing","year":"2017","author":"fischer","key":"ref20"}],"event":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","start":{"date-parts":[[2018,11,26]]},"location":"Anaheim, CA, USA","end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8637665\/8645964\/08646569.pdf?arnumber=8646569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T01:03:31Z","timestamp":1598231011000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8646569\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/globalsip.2018.8646569","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}