{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:02:35Z","timestamp":1649127755233},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NAVER"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/lsp.2018.2794768","type":"journal-article","created":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T19:17:53Z","timestamp":1516216673000},"page":"432-436","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Circulant Binary Embedding: An Asymptotic Analysis"],"prefix":"10.1109","volume":"25","author":[{"given":"Saehoon","family":"Kim","sequence":"first","affiliation":[]},{"given":"Seungjin","family":"Choi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Fast binary embeddins with gaussian circulant matrices: Improved bounds","author":"dirsken","year":"2016"},{"key":"ref11","article-title":"Near-optimal sample complexity bounds for circulant binary\n embedding","author":"oymak","year":"2016"},{"key":"ref12","first-page":"344","article-title":"Binary embeddings with structured hashed projections","author":"choromanska","year":"0","journal-title":"Proc Int Conf Mach Learning"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1460096.1460104"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540039"},{"key":"ref17","first-page":"485","article-title":"Quasi-monte carlo feature maps for\n shift-invariant kernels","author":"yang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020578"},{"key":"ref3","article-title":"On binary embedding using circulant matrices","author":"yu","year":"2015"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.69"},{"key":"ref5","first-page":"2162","article-title":"Binary embedding:\n Fundamental limits and fast algorithm","author":"yi","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","first-page":"3332","article-title":"Sparse projections for high-dimensional binary codes","author":"xia","year":"0","journal-title":"Proc IEEE Int Conf Comput Vis Pattern Recognit"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.335"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref1","first-page":"946","article-title":"Circulant binary embedding","author":"yu","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150436"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/8271403\/08260897.pdf?arnumber=8260897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:08Z","timestamp":1642004588000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8260897\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":17,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2018.2794768","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}