{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:28:31Z","timestamp":1729614511548,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034280","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"953-957","source":"Crossref","is-referenced-by-count":1,"title":["Compression with graphical constraints: An interactive browser"],"prefix":"10.1109","author":[{"given":"Amin","family":"Karbasi","sequence":"first","affiliation":[]},{"given":"Morteza","family":"Zadimoghaddam","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-002-0070-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2008.4563068"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513397"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.7551\/mitpress\/4908.003.0005","article-title":"Nearest-neighbor searching and metric space dimensions","author":"clarkson","year":"2006","journal-title":"Nearest-Neighbor Methods for Learning and Vision Theory and Practice"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341538"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.36"},{"article-title":"Approximate nearest neighbor search through comparisons","year":"2009","author":"tschopp","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454139"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22012-8_48"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290148"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0123019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48447-7_17"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90095-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979731858X"},{"key":"ref7","volume":"3","author":"knuth","year":"1998","journal-title":"The art of computer programming"},{"key":"ref2","article-title":"Shape recognition and twenty questions","author":"geman","year":"1993","journal-title":"Proc Reconnaissance des Formes et Intelligence Artificielle (RFIA Tech Rep"},{"key":"ref1","first-page":"438","article-title":"Visual recognition with humans in the loop","author":"branson","year":"2010","journal-title":"ECCV"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.06.001"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034280.pdf?arnumber=6034280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T10:12:11Z","timestamp":1713003131000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034280","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}