{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:45:01Z","timestamp":1725745501432},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409417"},{"type":"electronic","value":"9783642409424"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40942-4_8","type":"book-chapter","created":{"date-parts":[[2013,8,20]],"date-time":"2013-08-20T03:43:31Z","timestamp":1376970211000},"page":"86-97","source":"Crossref","is-referenced-by-count":4,"title":["On GPU-Based Nearest Neighbor Queries for Large-Scale Photometric Catalogs in Astronomy"],"prefix":"10.1007","author":[{"given":"Justin","family":"Heinermann","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Kramer","sequence":"additional","affiliation":[]},{"given":"Kai Lars","family":"Polsterer","sequence":"additional","affiliation":[]},{"given":"Fabian","family":"Gieseke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM\u00a051(1), 117\u2013122 (2008)","journal-title":"Communications of the ACM"},{"issue":"9","key":"8_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proceedings of the 23 International Conference on Machine Learning, pp. 97\u2013104. ACM (2006)","key":"8_CR3","DOI":"10.1145\/1143844.1143857"},{"doi-asserted-by":"crossref","unstructured":"Borne, K.: Scientific data mining in astronomy, arXiv:0911.0505v1 (2009)","key":"8_CR4","DOI":"10.1201\/9781420085877.ch5"},{"doi-asserted-by":"crossref","unstructured":"Bustos, B., Deussen, O., Hiller, S., Keim, D.: A graphics hardware accelerated algorithm for nearest neighbor search. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006, Part IV. LNCS, vol.\u00a03994, pp. 196\u2013199. Springer, Heidelberg (2006)","key":"8_CR5","DOI":"10.1007\/11758549_30"},{"doi-asserted-by":"crossref","unstructured":"Garcia, V., Debreuve, E., Barlaud, M.: Fast k nearest neighbor search using GPU. In: CVPR Workshop on Computer Vision on GPU, Anchorage, Alaska, USA (June 2008)","key":"8_CR6","DOI":"10.1109\/CVPRW.2008.4563100"},{"doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning, 2nd edn. Springer (2009)","key":"8_CR7","DOI":"10.1007\/978-0-387-84858-7"},{"unstructured":"Ivezic, Z., Tyson, J.A., Acosta, E., Allsman, R., andere: Lsst: from science drivers to reference design and anticipated data products (2011)","key":"8_CR8"},{"key":"8_CR9","volume-title":"Programming Massively Parallel Processors: A Hands-on Approach","author":"D.B. Kirk","year":"2010","unstructured":"Kirk, D.B., Wen-mei, H.: Programming Massively Parallel Processors: A Hands-on Approach, 1st edn. Morgan Kaufmann Publishers Inc., San Francisco (2010)","edition":"1"},{"unstructured":"Munshi, A., Gaster, B., Mattson, T.: OpenCL Programming Guide. OpenGL Series. Addison-Wesley (2011)","key":"8_CR10"},{"unstructured":"Nakasato, N.: Implementation of a parallel tree method on a gpu. CoRR, abs\/1112.4539 (2011)","key":"8_CR11"},{"unstructured":"nVidia Corporation. Opencl TM best practices guide (2009), \n                  \n                    http:\/\/www.nvidia.com\/content\/cudazone\/CUDABrowser\/downloads\/papers\/NVIDIA_OpenCL_BestPracticesGuide.pdf","key":"8_CR12"},{"key":"8_CR13","first-page":"2825","volume":"12","author":"F. Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: Machine Learning in Python. Journal of Machine Learning Research\u00a012, 2825\u20132830 (2011)","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1093\/mnras\/sts017","volume":"428","author":"K.L. Polsterer","year":"2013","unstructured":"Polsterer, K.L., Zinn, P., Gieseke, F.: Finding new high-redshift quasars by asking the neighbours. Monthly Notices of the Royal Astronomical Society (MNRAS)\u00a0428(1), 226\u2013235 (2013)","journal-title":"Monthly Notices of the Royal Astronomical Society (MNRAS)"},{"doi-asserted-by":"crossref","unstructured":"Shakhnarovich, G., Darrell, T., Indyk, P.: Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing). MIT Press (2006)","key":"8_CR15","DOI":"10.7551\/mitpress\/4908.001.0001"},{"unstructured":"York, D.G., et al.: The sloan digital sky survey: Technical summary. The Astronomical Journal\u00a0120(3), 1579\u20131587","key":"8_CR16"}],"container-title":["Lecture Notes in Computer Science","KI 2013: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40942-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T18:25:54Z","timestamp":1558031154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40942-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409417","9783642409424"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40942-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}