Fetching the paper…
Reading the bibliography…
Given a subset K of the unit Euclidean sphere, we estimate the minimal number m = m(K) of hyperplanes that generate a uniform tessellation of K, in the sense that the fraction of the hyperplanes separating any pair x, y in K is nearly proportional to the Euclidean distance between x and y.
W. Johnson, J. Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space
1984
Earlier work this paper cites.
M. Ledoux, M. Talagrand, Probability in Banach spaces. Isoperimetry and processes
1991
Earlier work this paper cites.
M. Goemans, D. Williamson, Improved approximation algorithms for the maximum cut and satisfiability problems using semidefinite programming
1995
Earlier work this paper cites.
E. Kushilevitz, R. Ostrovsky, Y. Rabani, Efficient search for approximate nearest neighbor in high dimensional spaces
2000
Earlier work this paper cites.
N. Alon, J. Spencer, The probabilistic method
2000
Earlier work this paper cites.
A. Giannopoulos, V. Milman, Euclidean structure in finite dimensional normed spaces
2001
Earlier work this paper cites.
M. Ledoux, The concentration of measure phenomenon
2001
Earlier work this paper cites.
M. Charikar Similarity estimation techniques from rounding algorithms
2002
Earlier work this paper cites.
J. Matousek, Lectures on discrete geometry
2002
Cited alongside, same era.
S. Mendelson, A few notes on Statistical Learning Theory
2003
Cited alongside, same era.
B. Klartag, S. Mendelson, Empirical processes and random projections
2005
Cited alongside, same era.
M. Talagrand, The generic chaining. Upper and lower bounds of stochastic processes
2005
Cited alongside, same era.
A. Andoni, P. Indyk, Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
2006
Cited alongside, same era.
G. Schechtman, Two observations regarding embedding subsets of Euclidean spaces in normed spaces
2006
Cited alongside, same era.
M. Rudelson, R. Vershynin, Sampling from large matrices: an approach through geometric functional analysis
2007
Later among the works it cites.
P. T. Boufounos, R. G. Baraniuk, 1-Bit compressive sensing
2008
Later among the works it cites.
N. Ailon, B. Chazelle, The Fast Johnson-Lindenstrauss transform and approximate nearest neighbors
2009
Later among the works it cites.
P. Calka, Tessellations
2010
Later among the works it cites.
P. Boufounos, Universal rate-efficient scalar quantization
2010
Later among the works it cites.
Y. Plan, R. Vershynin, One-bit compressed sensing by linear programming
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. E. Litvak, V. D. Milman, A. Pajor, N. Tomczak-Jaegermann, On the Euclidean metric entropy of convex bodies
2007
Cited alongside, same era.
L. Jacques, J. N. Laska, P. T. Boufounos, R. G. Baraniuk, Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors
Cited in the paper.
2011
Closest in time.
A. Ahmed, S. Ravi, S. Narayanamurthy, A. Smola, Fastex: Hash clustering with exponential families
2012
Closest in time.