{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:04:44Z","timestamp":1774991084450,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541253","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"21-25","source":"Crossref","is-referenced-by-count":1,"title":["Data driven quickest change detection: An algorithmic complexity approach"],"prefix":"10.1109","author":[{"given":"Husheng","family":"Li","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, the University of Tennessee, Knoxville, United States of America"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/41.1-2.100"},{"key":"ref11","author":"poor","year":"2009","journal-title":"Quickest Detection"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/013"},{"key":"ref13","article-title":"Spectrum sensing via universal source coding","author":"screedharan","year":"2012","journal-title":"Proc IEEE Global Communication Conf (GLOBECOM)"},{"key":"ref14","article-title":"Asymptotic properties of data compressions and suffix trees","author":"szpankowski","year":"1991","journal-title":"Tech Report Purdue Univ"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00298-W"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282538"},{"key":"ref6","author":"loeve","year":"1963","journal-title":"Probability Theory II"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282559"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000859"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2447506"},{"key":"ref1","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.179344"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541253.pdf?arnumber=7541253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:14Z","timestamp":1774986794000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541253\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541253","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}