{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:29:10Z","timestamp":1774945750583,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540853626","type":"print"},{"value":"9783540853633","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85363-3_41","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T19:29:28Z","timestamp":1219865368000},"page":"523-534","source":"Crossref","is-referenced-by-count":7,"title":["Near Optimal Dimensionality Reductions That Preserve Volumes"],"prefix":"10.1007","author":[{"given":"Avner","family":"Magen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasios","family":"Zouzias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375551.375608","volume-title":"PODS 2001: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","author":"D. Achlioptas","year":"2001","unstructured":"Achlioptas, D.: Database-friendly random projections. In: PODS 2001: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 274\u2013281. ACM, New York (2001)"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1247069.1247135","volume-title":"SCG 2007: Proceedings of the twenty-third annual symposium on Computational geometry","author":"P.K. Agarwal","year":"2007","unstructured":"Agarwal, P.K., Har-Peled, S., Yu, H.: Embeddings of surfaces, curves, and moving points in euclidean space. In: SCG 2007: Proceedings of the twenty-third annual symposium on Computational geometry, pp. 381\u2013389. ACM, New York (2007)"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1132516.1132597","volume-title":"STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing","author":"N. Ailon","year":"2006","unstructured":"Ailon, N., Chazelle, B.: Approximate nearest neighbors and the fast johnson-lindenstrauss transform. In: STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 557\u2013563. ACM, New York (2006)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Ailon, N., Liberty, E.: Fast dimension reduction using rademacher series on dual bch codes. In: SODA 2008: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 1\u20139 (2008)","DOI":"10.21236\/ADA471857"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Alon, N.: Problems and results in extremal combinatorics, i. Discrete Math.\u00a0(273), 31\u201353 (2003)","DOI":"10.1016\/S0012-365X(03)00227-9"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1377676.1377685","volume-title":"SCG 2008: Proceedings of the twenty-fourth annual symposium on Computational geometry","author":"K.L. Clarkson","year":"2008","unstructured":"Clarkson, K.L.: Tighter bounds for random projections of manifolds. In: SCG 2008: Proceedings of the twenty-fourth annual symposium on Computational geometry, pp. 39\u201348. ACM, New York (2008)"},{"key":"41_CR7","unstructured":"Engebretsen, L., Indyk, P., O\u2019Donnell, R.: Derandomized dimensionality reduction with applications. In: SODA 2002: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 705\u2013712 (2002)"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/276698.276716","volume-title":"STOC 1998: Proceedings of the thirtieth annual ACM symposium on Theory of computing","author":"U. Feige","year":"1998","unstructured":"Feige, U.: Approximating the bandwidth via volume respecting embeddings (extended abstract). In: STOC 1998: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 90\u201399. ACM, New York (1998)"},{"issue":"3","key":"41_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0095-8956(88)90043-3","volume":"44","author":"P. Frankl","year":"1987","unstructured":"Frankl, P., Maehara, H.: The johnson-lindenstrauss lemma and the sphericity of some graphs. J. Comb. Theory Ser. A\u00a044(3), 355\u2013362 (1987)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"41_CR10","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1214\/aos\/1176347387","volume":"17","author":"L. Gordon","year":"1989","unstructured":"Gordon, L.: Bounds for the distribution of the generalized variance. The Annals of Statistics\u00a017(4), 1684\u20131692 (1989)","journal-title":"The Annals of Statistics"},{"issue":"3","key":"41_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1273340.1273347","volume":"3","author":"P. Indyk","year":"2007","unstructured":"Indyk, P., Naor, A.: Nearest-neighbor-preserving embeddings. ACM Trans. Algorithms\u00a03(3), 31 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of lipschitz mappings into a hilbert space. In: Amer.\u00a0Math. Soc. (ed.) Conference in modern analysis and probability, pp. 189\u2013206. Providence, RI (1984)","DOI":"10.1090\/conm\/026\/737400"},{"key":"41_CR13","unstructured":"Liberty, E., Ailon, N., Singer, A.: Fast random projections using lean walsh transforms. In: RANDOM (to appear, 2008)"},{"issue":"1","key":"41_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00454-007-1329-4","volume":"38","author":"A. Magen","year":"2007","unstructured":"Magen, A.: Dimensionality reductions in \u21132 that preserve volumes and distance to affine spaces. Discrete & Computational Geometry\u00a038(1), 139\u2013153 (2007)","journal-title":"Discrete & Computational Geometry"},{"key":"41_CR15","unstructured":"Matousek, J.: On the variants of johnson lindenstrauss lemma (manuscript) (2006)"},{"key":"41_CR16","unstructured":"Prekopa, A.: On random determinants i. Studia Scientiarum Mathematicarum Hungarica\u00a0(2), 125\u2013132 (1967)"},{"key":"41_CR17","first-page":"143","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science","author":"T. Sarlos","year":"2006","unstructured":"Sarlos, T.: Improved approximation algorithms for large matrices via random projections. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 143\u2013152. IEEE Computer Society, Los Alamitos (2006)"},{"key":"41_CR18","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/509907.509996","volume-title":"STOC 2002: Proceedings of the thirty-fourth annual ACM symposium on Theory of computing","author":"D. Sivakumar","year":"2002","unstructured":"Sivakumar, D.: Algorithmic derandomization via complexity theory. In: STOC 2002: Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pp. 619\u2013626. ACM, New York (2002)"},{"key":"41_CR19","first-page":"389","volume-title":"FOCS 1998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science","author":"S. Vempala","year":"1998","unstructured":"Vempala, S.: Random projection: A new approach to vlsi layout. In: FOCS 1998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 389. IEEE Computer Society, Los Alamitos (1998)"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Wakin, M.B., Baraniuk, R.G.: Random projections of signal manifolds. In: Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing. ICASSP 2006, vol.\u00a05, p. V (May 2006)","DOI":"10.1109\/ICASSP.2006.1661432"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85363-3_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:24:22Z","timestamp":1606184662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85363-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540853626","9783540853633"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85363-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}