{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:26:05Z","timestamp":1781072765643,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,18]],"date-time":"2013-12-18T00:00:00Z","timestamp":1387324800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00454-013-9561-6","type":"journal-article","created":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T11:26:42Z","timestamp":1387279602000},"page":"438-461","source":"Crossref","is-referenced-by-count":80,"title":["Dimension Reduction by Random Hyperplane Tessellations"],"prefix":"10.1007","volume":"51","author":[{"given":"Yaniv","family":"Plan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roman","family":"Vershynin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,12,18]]},"reference":[{"key":"9561_CR1","volume-title":"Advances in Neural Information Processing Systems","author":"A. Ahmed","year":"2012","unstructured":"Ahmed, A., Ravi, S., Narayanamurthy, S., Smola, A.: Fastex: Hash clustering with exponential families. In: Advances in Neural Information Processing Systems, vol.\u00a025 (2012)"},{"key":"9561_CR2","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/060673096","volume":"39","author":"N. Ailon","year":"2009","unstructured":"Ailon, N., Chazelle, B.: The fast Johnson\u2013Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39, 302\u2013322 (2009)","journal-title":"SIAM J. Comput."},{"key":"9561_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)","edition":"2"},{"key":"9561_CR4","volume-title":"47th Annual IEEE Symposium on Foundations of Comp. Sci. (FOCS)","author":"A. Andoni","year":"2006","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: 47th Annual IEEE Symposium on Foundations of Comp. Sci. (FOCS) (2006)"},{"key":"9561_CR5","unstructured":"Boufounos, P.: Universal rate-efficient scalar quantization (2010). arXiv:1009.3145"},{"key":"9561_CR6","volume-title":"42nd Annual Conference on Information Sciences and Systems (CISS)","author":"P.T. Boufounos","year":"2008","unstructured":"Boufounos, P.T., Baraniuk, R.G.: 1-Bit compressive sensing. In: 42nd Annual Conference on Information Sciences and Systems (CISS) (2008)"},{"key":"9561_CR7","first-page":"145","volume-title":"Tessellations. New Perspectives in Stochastic Geometry","author":"P. Calka","year":"2010","unstructured":"Calka, P.: Tessellations. New Perspectives in Stochastic Geometry, pp. 145\u2013169. Oxford University Press, Oxford (2010)"},{"key":"9561_CR8","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing","author":"M. Charikar","year":"2002","unstructured":"Charikar, M.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (2002)"},{"key":"9561_CR9","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/S1874-5849(01)80019-X","volume-title":"Handbook of the Geometry of Banach Spaces","author":"A. Giannopoulos","year":"2001","unstructured":"Giannopoulos, A., Milman, V.: Euclidean structure in finite dimensional normed spaces. In: Handbook of the Geometry of Banach Spaces, vol.\u00a0I, pp. 707\u2013779. North-Holland, Amsterdam (2001)"},{"key":"9561_CR10","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for the maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"9561_CR11","doi-asserted-by":"crossref","unstructured":"Jacques, L., Laska, J.N., Boufounos, P.T., Baraniuk, R.G.: Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors. doi: 10.1109\/TIT.2012.2234823","DOI":"10.1109\/TIT.2012.2234823"},{"key":"9561_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"W. Johnson","year":"1984","unstructured":"Johnson, W., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26, 189\u2013206 (1984)","journal-title":"Contemp. Math."},{"key":"9561_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.jfa.2004.10.009","volume":"225","author":"B. Klartag","year":"2005","unstructured":"Klartag, B., Mendelson, S.: Empirical processes and random projections. J. Funct. Anal. 225, 229\u2013245 (2005)","journal-title":"J. Funct. Anal."},{"key":"9561_CR14","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1137\/S0097539798347177","volume":"30","author":"E. Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30, 457\u2013474 (2000)","journal-title":"SIAM J. Comput."},{"key":"9561_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in Banach Spaces. Isoperimetry and Processes","author":"M. Ledoux","year":"1991","unstructured":"Ledoux, M., Talagrand, M.: Probability in Banach Spaces. Isoperimetry and Processes. Springer, Berlin (1991)"},{"key":"9561_CR16","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-3-540-72053-9_11","volume-title":"Geometric Aspects of Functional Analysis","author":"A.E. Litvak","year":"2007","unstructured":"Litvak, A.E., Milman, V.D., Pajor, A., Tomczak-Jaegermann, N.: On the Euclidean metric entropy of convex bodies. In: Geometric Aspects of Functional Analysis. Lecture Notes in Math., vol. 1910, pp.\u00a0221\u2013235. Springer, Berlin (2007)"},{"key":"9561_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matousek","year":"2002","unstructured":"Matousek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"key":"9561_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-36434-X_1","volume-title":"Advanced Lectures in Machine Learning","author":"S. Mendelson","year":"2003","unstructured":"Mendelson, S.: A few notes on statistical learning theory. In: Mendelson, S., Smola, A.J. (eds.) Advanced Lectures in Machine Learning. Lecture Notes in Computer Science, vol. 2600, pp. 1\u201340. Springer, Berlin (2003)"},{"key":"9561_CR19","unstructured":"Plan, Y., Vershynin, R.: One-bit compressed sensing by linear programming (2011, submitted). arXiv:1109.4299v4"},{"key":"9561_CR20","doi-asserted-by":"crossref","unstructured":"Rudelson, M., Vershynin, R.: Sampling from large matrices: an approach through geometric functional analysis. J. ACM 21 (2007). 19 pp.","DOI":"10.1145\/1255443.1255449"},{"key":"9561_CR21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.aim.2004.11.003","volume":"200","author":"G. Schechtman","year":"2006","unstructured":"Schechtman, G.: Two observations regarding embedding subsets of Euclidean spaces in normed spaces. Adv. Math. 200, 125\u2013135 (2006)","journal-title":"Adv. Math."},{"key":"9561_CR22","volume-title":"The Generic Chaining. Upper and Lower Bounds of Stochastic Processes","author":"M. Talagrand","year":"2005","unstructured":"Talagrand, M.: The Generic Chaining. Upper and Lower Bounds of Stochastic Processes. Springer, Berlin (2005)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9561-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-013-9561-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9561-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T21:14:23Z","timestamp":1564953263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-013-9561-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,18]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9561"],"URL":"https:\/\/doi.org\/10.1007\/s00454-013-9561-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,18]]}}}