{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:42Z","timestamp":1725664962176},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625926"},{"type":"electronic","value":"9783540683230"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62592-5_69","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:40Z","timestamp":1330278220000},"page":"159-170","source":"Crossref","is-referenced-by-count":0,"title":["An improved deterministic algorithm for generalized random sampling"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuel","family":"Dar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"1+2","key":"15_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1080\/00207169308804187","volume":"48","author":"A. Amir","year":"1993","unstructured":"A. Amir. A pearl diver deals a poker hand. Intl. J. of Computer Mathematics, 48(1+2):11\u201314, 1993.","journal-title":"Intl. J. of Computer Mathematics"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/0167-8655(91)90005-7","volume":"12","author":"A. Amir","year":"1991","unstructured":"A. Amir and D. Mintz. An efficient algorithm for generalized random sampling. Pattern Recognition Letters, 12:683\u2013686, 1991.","journal-title":"Pattern Recognition Letters"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"J. Bentley. Programming pearls \u2014 a little program, a lot of fun. Comm. of ACM, pages 1179\u20131182, 1984.","DOI":"10.1145\/2135.381151"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"J. Bentley and R. Floyd. Programming pearls \u2014 a sample of brilliance. Comm. of ACM, pages 754\u2013757, 1987.","DOI":"10.1145\/30401.315746"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"J. Bentley and D. Gries. Programming pearls \u2014 abstract data types. Comm. of ACM, pages 284\u2013290, 1987.","DOI":"10.1145\/32232.315727"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"J. Bentley and D. Knuth. Programming pearls \u2014 literate programming. Comm. of ACM, pages 364\u2013369, 1986.","DOI":"10.1145\/5689.315644"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(88)90118-4","volume":"29","author":"M. Chrobak","year":"1988","unstructured":"M. Chrobak and R. Harter. A note on random sampling. Inform. Process. Lett., 29:255\u2013256, 1988.","journal-title":"Inform. Process. Lett."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"M. A. Fischler and R. C. Bolles. Random sampling consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Comm. of ACM, June 1981.","DOI":"10.1145\/358669.358692"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"G. M. Knott. A numbering system for combinations. Comm. of ACM, pages 45\u201346, 1974.","DOI":"10.1145\/360767.360811"},{"key":"15_CR10","volume-title":"The Machine Tool of Combinatorics","author":"D. H. Lehmer","year":"1964","unstructured":"D. H. Lehmer. Applied Combinatorial Mathematics, chapter The Machine Tool of Combinatorics. Wiley, New York, 1964."},{"key":"15_CR11","unstructured":"P. Meer, D. Mintz, and A. Rozenfeld. Least median of squares based robust analysis of image structure. In Proc. Image Understanding Workshop, Pittsburgh, PA, Sept. 1990."},{"key":"15_CR12","volume-title":"Combinatorial Algorithms","author":"A. Nijenhuis","year":"1978","unstructured":"A. Nijenhuis and H. Wilf. Combinatorial Algorithms. Academic Press, New York, 2nd edition, 1978.","edition":"2nd edition"},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0020-0190(89)90206-8","volume":"30","author":"V. Rajan","year":"1989","unstructured":"V. Rajan, R. K. Ghosh, and P. Gupta. An efficient parallel algorithm for random sampling. Inform. Process. Lett., 30:265\u2013268, 1989.","journal-title":"Inform. Process. Lett."},{"key":"15_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/0471725382","volume-title":"Robust Regression and Outlier Detection","author":"P. J. Rousseuw","year":"1987","unstructured":"P. J. Rousseuw and A. M. Leroy. Robust Regression and Outlier Detection. Wiley, New York, 1987."},{"key":"15_CR15","first-page":"281","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage and V. Strassen. Schnelle multiplikation grosser zahlen. Computing (Arch. Elektron. Rechnen), 7:281\u2013292, 1971. MR 45 # 1431.","journal-title":"Computing (Arch. Elektron. Rechnen)"},{"key":"15_CR16","unstructured":"A. Tirumalai and B. G. Schunck. Robust surface approximation using least median squares regression. Technical Report CSE-TR-13-89, University of Michigan, 1989."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62592-5_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:32Z","timestamp":1605629612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62592-5_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625926","9783540683230"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-62592-5_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}