{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:25:04Z","timestamp":1726406704565},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_239","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:05:12Z","timestamp":1330239912000},"page":"95-106","source":"Crossref","is-referenced-by-count":0,"title":["Point probe decision trees for geometric concept classes"],"prefix":"10.1007","author":[{"given":"Esther M.","family":"Arkin","sequence":"first","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"David","family":"Mount","sequence":"additional","affiliation":[]},{"given":"Christine D.","family":"Piatko","sequence":"additional","affiliation":[]},{"given":"Steven S.","family":"Skiena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"11_CR1","unstructured":"E. Arkin and J. Mitchell. Applications of combinatorics and computational geometry to pattern recognition. Technical report, Cornell University, 1990."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"E.M. Arkin, H. Meijer, J.S.B. Mitchell, D. Rappaport, and S.S. Skiena. Decision trees for geometric models. Proc. Ninth ACM Symp. on Comput. Geometry, 1993.","DOI":"10.1145\/160985.161167"},{"key":"11_CR3","unstructured":"E. Bienenstock, D. Geman, and S. Geman. A relational approach in object recognition. Technical report, Brown University, 1988."},{"key":"11_CR4","unstructured":"E. Bienenstock, D. Geman, S. Geman, and D.E. McClure. Phase II: Development of laser radar ATR algorithms. Contract No. DAAL02-89-C-0081, CECOM Center for Night Vision and Electro-Optics, 1990."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/147508.147511","volume":"39","author":"B. Chazelle","year":"1992","unstructured":"B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J. ACM, 39:1\u201354, 1992.","journal-title":"J. ACM"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1137\/0123019","volume":"23","author":"M. Garey","year":"1972","unstructured":"M. Garey. Optimal binary identification procedures. SIAM J. Appl. Math., 23:173\u2013186, 1972.","journal-title":"SIAM J. Appl. Math."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/1049-9652(92)90029-W","volume":"54","author":"M. T. Goodrich","year":"1992","unstructured":"M. T. Goodrich. A polygonal approach to hidden-line and hidden-surface elimination. CVGIP: Graphical Models and Image Processing, 54:1\u201312, 1992.","journal-title":"CVGIP: Graphical Models and Image Processing"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L. Hyafil","year":"1976","unstructured":"L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15\u201317, 1976.","journal-title":"Information Processing Letters"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"L. Lov\u00e1sz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383\u2013390, 1975.","journal-title":"Discrete Mathematics"},{"key":"11_CR10","volume-title":"Computer vision is a highly structured optimization problem","author":"V. Mirelli","year":"1990","unstructured":"V. Mirelli. Computer vision is a highly structured optimization problem. Manuscript, Center for Night Vision and Electro-Optics, Fort Belvoir, VA, 1990."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"B. Moret. Decision trees and diagrams. Computing Surveys, pages 593\u2013623, 1982.","DOI":"10.1145\/356893.356898"},{"key":"11_CR12","unstructured":"C. H. Papadimitriou. On certain problems in algorithmic vision. Technical report, Computer Science, UCSD, 1991."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_239.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:58:36Z","timestamp":1619557116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_239","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}