{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T21:40:09Z","timestamp":1743975609378,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_32","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T15:12:12Z","timestamp":1344870732000},"page":"372-383","source":"Crossref","is-referenced-by-count":1,"title":["Partially Specified Nearest Neighbor Search"],"prefix":"10.1007","author":[{"given":"Tomas","family":"Hruz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Sch\u00f6ngens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF02574015","volume":"11","author":"P.K. Agarwal","year":"1994","unstructured":"Agarwal, P.K., Matou\u0161ek, J.: On Range Searching with Semialgebraic Sets. Discrete and Computational Geometry\u00a011(1), 393\u2013418 (1994)","journal-title":"Discrete and Computational Geometry"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Krauthgamer, R., Nguyen, H.L.: Approximate Line Nearest Neighbor in High Dimensions. In: SODA 2009: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 293\u2013301. ACM (2009)","DOI":"10.1137\/1.9781611973068.33"},{"key":"32_CR3","unstructured":"Arasu, A., Cho, J., Garcia-Molina, H., Paepcke, A., Raghavan, S.: Searching the Web. Technical Report 2000-37. Stanford InfoLab (2000)"},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1328911.1328920","volume":"4","author":"L. Arge","year":"2008","unstructured":"Arge, L., Berg, M.D., Haverkort, H., Yi, K.: The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms\u00a04, 9:1\u20139:30 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-642-13818-8_38","volume-title":"Scientific and Statistical Database Management","author":"T. Bernecker","year":"2010","unstructured":"Bernecker, T., Emrich, T., Graf, F., Kriegel, H.-P., Kr\u00f6ger, P., Renz, M., Schubert, E., Zimek, A.: Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces. In: Gertz, M., Lud\u00e4scher, B. (eds.) SSDBM 2010. LNCS, vol.\u00a06187, pp. 555\u2013564. Springer, Heidelberg (2010)"},{"issue":"5","key":"32_CR6","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1137\/S0097539796260321","volume":"28","author":"H. Br\u00f6nnimann","year":"1999","unstructured":"Br\u00f6nnimann, H., Chazelle, B., Matou\u0161ek, J.: Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM Journal on Computing\u00a028(5), 1575 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Optimal Partition Trees. In: SCG 2010: Proceedings of the 2010 Annual Symposium on Computational Geometry, pp. 1\u201310. ACM (2010)","DOI":"10.1145\/1810959.1810961"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry - Algorithms and Applications, 2nd edn. Springer (2000)","DOI":"10.1007\/978-3-662-04245-8"},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(82)90106-5","volume":"15","author":"C.M. Eastman","year":"1982","unstructured":"Eastman, C.M., Zemankova, M.: Partially Specified Nearest Neighbor Searches Using k-d Trees. Information Processing Letter\u00a015(2), 53\u201356 (1982)","journal-title":"Information Processing Letter"},{"key":"32_CR10","unstructured":"Goodman, J.E., O\u2019Rourke, J. (eds.): Handbook of Discrete and Computational Geometry, 2nd edn. CRC Press (2004)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Haussler, D., Welzl, E.: Epsilon-nets and Simplex Range Queries. In: SCG 1986: Proceedings of the 2nd Annual Symposium on Computational Geometry, p. 71. ACM (1986)","DOI":"10.1145\/10515.10522"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Hruz, T., Sch\u00f6ngens, M.: Partially Specified Nearest Neighbor Search. Technical Report 762. Department of Computer Science, ETH Zurich (2012)","DOI":"10.1007\/978-3-642-32241-9_32"},{"issue":"1","key":"32_CR13","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1186\/1471-2164-12-156","volume":"12","author":"T. Hruz","year":"2011","unstructured":"Hruz, T., Wyss, M., et al.: RefGenes: identification of reliable and condition specific reference genes for RT-qPCR data normalization. BMC Genomics\u00a012(1), 156 (2011)","journal-title":"BMC Genomics"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. In: STOC 1998: Proceedings of the 30th Annual ACM Symposioum on Theory of Computing, pp. 604\u2013613. ACM (1998)","DOI":"10.1145\/276698.276876"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Koltun, V.: Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions. In: FOCS 2001: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 56\u201365. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959880"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Kriegel, H., Kroger, P., Schubert, M., Zhu, Z.: Efficient Query Processing in Arbitrary Subspaces Using Vector Approximations. In: SSDBM 2006: Proceedings of the 18th International Conference on Scientific and Statistical Database Management, pp. 184\u2013190 (2006)","DOI":"10.1109\/SSDBM.2006.23"},{"issue":"1","key":"32_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00263763","volume":"9","author":"D.T. Lee","year":"1977","unstructured":"Lee, D.T., Wong, C.: Worst-case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees. Acta Informatica\u00a09(1), 23\u201329 (1977)","journal-title":"Acta Informatica"},{"key":"32_CR18","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: Efficient Indexing for High-Dimensional Similarity Search. In: VLDB 2007: Proceedings of the 33rd International Conference on Very Rarge Data Bases, pp. 950\u2013961 (2007)"},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0925-7721(92)90006-E","volume":"2","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Reporting Points in Halfspaces. Computational Geometry\u00a02, 169\u2013186 (1992)","journal-title":"Computational Geometry"},{"issue":"4","key":"32_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/PL00009394","volume":"20","author":"J. Matou\u0161ek","year":"1998","unstructured":"Matou\u0161ek, J.: On Constants for Cuttings in the Plane. Discrete & Computational Geometry\u00a020(4), 427\u2013448 (1998)","journal-title":"Discrete & Computational Geometry"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lecture Notes on Discrete Geometry. Sp (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"32_CR22","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc. (2005)"},{"key":"32_CR23","unstructured":"Sharir, M., Shaul, H.: Ray Shooting Amid Balls, Farthest Point from a Line, and Range Emptiness Searching. In: SODA 2005: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 525\u2013534 (2005)"},{"key":"32_CR24","unstructured":"Stanford WebBase Project, http:\/\/diglib.stanford.edu:8091\/~testbed\/doc2\/WebBase"},{"issue":"5","key":"32_CR25","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1093\/mp\/ssn048","volume":"1","author":"P. Zimmermann","year":"2008","unstructured":"Zimmermann, P., Laule, O., Schmitz, J., Hruz, T., Bleuler, S., Gruissem, W.: Genevestigator transcriptome meta-analysis and biomarker search using rice and barley gene expression databases. Molecular Plant\u00a01(5), 851 (2008)","journal-title":"Molecular Plant"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T21:09:12Z","timestamp":1743973752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}