{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:58:35Z","timestamp":1761058715011},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441472"},{"type":"electronic","value":"9783540457268"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45726-7_19","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T09:55:49Z","timestamp":1186826149000},"page":"239-253","source":"Crossref","is-referenced-by-count":24,"title":["Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications"],"prefix":"10.1007","author":[{"given":"Avner","family":"Magen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Dimitris Achlioptas. Database-friendly random projections. In roceedings of PODS 01, pages 274\u2013281, 2001.","DOI":"10.1145\/375551.375608"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"R.I. Arriaga and S. Vempala. An algorithmic theory of learning: Robust concepts and random projections. In Proceeding of the 31th Symposium on the Theory of Computing, New York, 1999.","DOI":"10.1109\/SFFCS.1999.814637"},{"key":"19_CR3","volume-title":"Technical Report TR-99-06","author":"S. Dasgupta","year":"1999","unstructured":"S. Dasgupta and A. Gupta. An elementary proof of the johnson-lindenstrauss lemma. In Technical Report TR-99-06, Computer Scinece Institute, Berkeley, CA, 1999."},{"key":"19_CR4","unstructured":"L. Engebretsen, P. Indyk, and R. O\u2019Donnell. Derandomized dimensionality reduction with applications. In Proceedings of the 13th Symposium on Discrete Algorithms. IEEE, 2002."},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1006\/jcss.1999.1682","volume":"60","author":"U. Feige","year":"2000","unstructured":"U. Feige. Approximating the bandwidth via volume respecting embeddings. J. Comput. System Sci., 60(3):510\u2013539, 2000.","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0095-8956(88)90043-3","volume":"44","author":"P. Frankl","year":"1988","unstructured":"P. Frankl and H. Mahera. The johnson lindenstrauss lemma and the sphericity of some graphs. J. Combin. Theory Ser. B, 44(2):355\u2013362, 1988.","journal-title":"J. Combin. Theory Ser. B"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"S. Har-Peled and K. R. Varadarajan. Projective clustering in high dimensions using core-sets. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pages 312\u2013318, 2002.","DOI":"10.1145\/513400.513440"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. In Proceedings of the Thirty Second Symposium on Theory of Computing, pages 604\u2013613. ACM, 1998.","DOI":"10.1145\/276698.276876"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume-title":"Conference in modern analysis and probability (New Haven, Conn., 1982)","author":"W. B. Johnson","year":"1984","unstructured":"W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, Conn., 1982), pages 189\u2013206. Amer. Math. Soc., Providence, RI, 1984."},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"N. Linial, E. London, and Yu. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215\u2013245, 1995.","journal-title":"Combinatorica"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1006\/inco.1993.1057","volume":"106","author":"S. Meiser","year":"1993","unstructured":"S. Meiser. Point location in arrangements of hyperplanes. Information and Computation, 106:286\u2013303, 1993.","journal-title":"Information and Computation"},{"key":"19_CR12","unstructured":"Agarwal P. and Procopiuc C. Approximation algortihms for strip cover in the plane. In Proceeding of the 11th ACM-SIAM Symposium on Discrete Algorithms, pages 373\u2013382, 2000."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the Fifteenth Annual Symposium on Computational Geometry (Miami Beach, FL, 1999), pages 300\u2013306 (electronic), New York, 1999. ACM.","DOI":"10.1145\/304893.304983"},{"key":"19_CR14","unstructured":"S. Vempala. Approximating vlsi layout problems. In Proceedings of the thirty ninth Symposium on Foundations of Computer Science. IEEE, 1998."}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45726-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:04:44Z","timestamp":1556751884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45726-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441472","9783540457268"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45726-7_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}