{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:00:28Z","timestamp":1729616428818,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1109\/ntms.2011.5720646","type":"proceedings-article","created":{"date-parts":[[2011,3,2]],"date-time":"2011-03-02T08:37:35Z","timestamp":1299055055000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing Position Updates for kNN - Is It Worth It?"],"prefix":"10.1109","author":[{"given":"Philipp","family":"Engel","sequence":"first","affiliation":[]},{"given":"Florian","family":"Gschwandtner","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Martens","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Fuchs","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Treu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/777943.777944"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066230"},{"journal-title":"Position Management fur ortsbezogene Dienste","year":"2008","author":"treu","key":"ref12"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/11863939_17","article-title":"Incremental rank updates for moving query points","author":"kulik","year":"2006","journal-title":"Lecture Notes in Computer Science"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453973"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73871-8_23"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1705987"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/B:WINE.0000036458.88990.e5"},{"key":"ref18","first-page":"964","article-title":"Energy consumption of always-on applications in wcdma networks","author":"haverinen","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872812"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/0470092335"},{"key":"ref6","first-page":"478","article-title":"On k-nearest neighbor voronoi diagrams in the plane","volume":"31","author":"lee","year":"1982","journal-title":"IEEE Trans Comput"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1002\/9780470317013","author":"okabe","year":"2000","journal-title":"Spatial Tessellations Concepts and Applications of Voronoi Diagrams"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564730"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-47724-1_5","article-title":"K-nearest neighbor search for moving query point","author":"song","year":"2001","journal-title":"Advances in Spatial and Temporal Databases"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39867-7_34"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/280765.280875"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50033-0"}],"event":{"name":"2011 4th IFIP International Conference on New Technologies, Mobility and Security (NTMS 2011)","start":{"date-parts":[[2011,2,7]]},"location":"Paris","end":{"date-parts":[[2011,2,10]]}},"container-title":["2011 4th IFIP International Conference on New Technologies, Mobility and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5720565\/5720575\/05720646.pdf?arnumber=5720646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T16:25:15Z","timestamp":1497889515000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5720646\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/ntms.2011.5720646","relation":{},"subject":[],"published":{"date-parts":[[2011,2]]}}}