{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:23Z","timestamp":1742617163998,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573708"},{"type":"electronic","value":"9783540480969"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57370-4_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:55:44Z","timestamp":1330260944000},"page":"288-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["\u03b5-approximations of k-label spaces"],"prefix":"10.1007","author":[{"given":"Susumu","family":"Hasegawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaki","family":"Ishiguro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Learnability and Vapnik Chervonenkis dimension. Journal of the ACM, 36(4):929\u2013965, October 1989.","journal-title":"Journal of the ACM"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"23_CR3","unstructured":"S. Hasegawa. A Study on \u03b5-net and \u03b5-approximation. Mater's Thesis, Department of Information Science, University of Tokyo, 1993."},{"key":"23_CR4","volume-title":"Technical Report UCSC-CRL-90-15","author":"D. Haussler","year":"1991","unstructured":"D. Haussler and P. Long. A generalization of Sauer's Lemma. Technical Report UCSC-CRL-90-15, University of California at Santa Cruz, 1991."},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"D. Haussler and E. Welzl. Epsilon-Nets and Simplex Range Queries. Discrete and Computational Geometry, 2:127\u2013151, 1987.","journal-title":"Discrete and Computational Geometry"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek, E. Welzl and L. Wernisch. Discrepancy and \u03b5-approximations for bounded VC-dimension Proc. 32nd Annual Symposium on Foundations of Computer Science: 424\u2013430, 1991.","DOI":"10.1109\/SFCS.1991.185401"},{"key":"23_CR7","unstructured":"P. Raghavan. Lecture Notes on Randomized Algorithms. IBM Research Report RC 15340, IBM Research Division, 1990."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N. Sauer","year":"1972","unstructured":"N. Sauer. On the density of families of sets. J. Combinatorial Theory (A), 13:145\u2013147, 1972.","journal-title":"J. Combinatorial Theory (A)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"T. Tokuyama and J. Nakano. Geometric Algorithms on an Assignment Problem. Proc. 7th ACM Symposium on Computational Geometry: 262\u2013271, 1991.","DOI":"10.1145\/109648.109678"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. N. Vapnik","year":"1971","unstructured":"V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and Its Applications, 16:264\u2013280, 1971.","journal-title":"Theory of Probability and Its Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57370-4_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:09:11Z","timestamp":1742594951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57370-4_55"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573708","9783540480969"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-57370-4_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}