{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:25:06Z","timestamp":1725593106528},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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":[[2019,10]]},"DOI":"10.1109\/cccs.2019.8888142","type":"proceedings-article","created":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T19:58:48Z","timestamp":1572551928000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Computational Complexity Upper Bounds For Fingerprint-Based Point-Of-Interest Recognition Algorithms"],"prefix":"10.1109","author":[{"given":"Igor","family":"Bisio","sequence":"first","affiliation":[]},{"given":"Fabio","family":"Lavagetto","sequence":"additional","affiliation":[]},{"given":"Chiara","family":"Garibotto","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Sciarrone","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2013.2239631"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2905363"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2016.02.001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1620545.1620549"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/1938545.1938550"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11551201_10"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77120-3_64"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1869983.1869989"},{"journal-title":"Effective Computation in Physics","year":"2015","author":"anthony scopatz","key":"ref2"},{"key":"ref9","first-page":"1","article-title":"Efficient self-adjustment places of interest finding by eliminating dynamic access point beacons in public places","author":"lin","year":"2013","journal-title":"International Symposium on Wireless and pervasive Computing (ISWPC)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.879269"}],"event":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","start":{"date-parts":[[2019,10,10]]},"location":"Rome, Italy","end":{"date-parts":[[2019,10,12]]}},"container-title":["2019 4th International Conference on Computing, Communications and Security (ICCCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8883094\/8888030\/08888142.pdf?arnumber=8888142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:49:07Z","timestamp":1658080147000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8888142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/cccs.2019.8888142","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}