Fetching the paper…
Reading the bibliography…
We study spectral algorithms for the high-dimensional Nearest Neighbor Search problem (NNS).
The rotation of eigenvectors by a perturbation. III
C. Davis and W. M. Kahan · 1970
Earlier work this paper cites.
Perturbation bounds in connection with singular value decomposition
P.-Å. Wedin · 1972
Earlier work this paper cites.
Extensions of lipshitz mapping into hilbert space
W. Johnson and J. Lindenstrauss · 1984
Earlier work this paper cites.
A randomized algorithm for closest-point queries
K. Clarkson · 1988
Earlier work this paper cites.
Refinements to nearest-neighbor searching in
R. Sproull · 1991
Earlier work this paper cites.
Computational complexity of inner and outer
P. Gritzmann and V. Klee · 1993
Earlier work this paper cites.
Point location in arrangements of hyperplanes
S. Meiser · 1993
Earlier work this paper cites.
On the early history of the singular value decomposition
G. W. Stewart · 1993
Earlier work this paper cites.
An algorithm for approximate closest-point queries
K. Clarkson · 1994
Earlier work this paper cites.
An optimal algorithm for approximate nearest neighbor searching
S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A. Wu · 1998
Earlier work this paper cites.
Approximate nearest neighbor: towards removing the curse of dimensionality
P. Indyk and R. Motwani · 1998
Earlier work this paper cites.
Adaptive estimation of a quadratic functional by model selection
B. Laurent and P. Massarat · 1998
Earlier work this paper cites.
Learning mixtures of gaussians
S. Dasgupta · 1999
Earlier work this paper cites.
Learning a mixture of gaussians
S. Arora and R. Kannan · 2001
Earlier work this paper cites.
A replacement for voronoi diagrams of near linear size
S. Har-Peled · 2001
Earlier work this paper cites.
A fast nearest-neighbor algorithm based on a principal axis search tree
J. McNames · 2001
Earlier work this paper cites.
Linear-size approximate voronoi diagrams
S. Arya and T. Malamatos · 2002
Earlier work this paper cites.
Finding nearest neighbors in growth-restricted metrics
D. Karger and M. Ruhl · 2002
Earlier work this paper cites.
On approximating the radii of point sets in high dimensions
K. R. Varadarajan, S. Venkatesh, and J. Zhang · 2002
Cited alongside, same era.
Problems and results in extremal combinatorics I
N. Alon · 2003
Cited alongside, same era.
Tight lower bounds for the distinct elements problem
P. Indyk and D. Woodruff · 2003
Cited alongside, same era.
Locality-sensitive hashing scheme based on p-stable distributions
M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni · 2004
Cited alongside, same era.
High-dimensional shape fitting in linear time
S. Har-Peled and K. R. Varadarajan · 2004
Cited alongside, same era.
Navigating nets: Simple algorithms for proximity search
R. Krauthgamer and J. Lee · 2004
Cited alongside, same era.
Random projection trees and low dimensional manifolds
S. Dasgupta and Y. Freund · 2008
Later among the works it cites.
Optimised kd-trees for fast image descriptor matching
C. Silpa-Anan and R. Hartley · 2008
Later among the works it cites.
Spectral hashing
Y. Weiss, A. Torralba, and R. Fergus · 2008
Later among the works it cites.
Space-time tradeoffs for approximate nearest neighbor searching
S. Arya, T. Malamatos, and D. M. Mount · 2009
Later among the works it cites.
Spectral algorithms
R. Kannan and S. Vempala · 2009
Later among the works it cites.
Fast approximate nearest neighbors with automatic algorithm configuration
M. Muja and D. G. Lowe · 2009
Later among the works it cites.
Semantic hashing
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A spectral algorithm for learning mixture models
S. Vempala and G. Wang · 2004
Cited alongside, same era.
Optimal space lower bounds for all frequency moments
D. Woodruff · 2004
Cited alongside, same era.
Fast construction of nets in low dimensional metrics, and their applications
S. Har-Peled and M. Mendel · 2005
Cited alongside, same era.
Some estimates of norms of random matrices
R. Latała · 2005
Cited alongside, same era.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
A. Andoni and P. Indyk · 2006
Cited alongside, same era.
On the optimality of the dimensionality reduction method
A. Andoni, P. Indyk, and M. Pǎtraşcu · 2006
Cited alongside, same era.
R. Salakhutdinov and G. Hinton · 2009
Later among the works it cites.
Smoothed analysis: An attempt to explain the behavior of algorithms in practice
D. A. Spielman and S.-H. Teng · 2009
Later among the works it cites.
Which spatial partition trees are adaptive to intrinsic dimension?
N. Verma, S. Kpotufe, and S. Dasgupta · 2009
Later among the works it cites.
Settling the polynomial learnability of mixtures of gaussians
A. Moitra and G. Valiant · 2010
Later among the works it cites.
Non-asymptotic theory of random matrices: extreme singular values
M. Rudelson and R. Vershynin · 2010
Later among the works it cites.
The power of comparative reasoning
J. Yagnik, D. Strelow, D. A. Ross, and R.-S. Lin · 2011
Later among the works it cites.
Reporting neighbors in high-dimensional euclidean spaces
D. Aiger, H. Kaplan, and M. Sharir · 2013
Later among the works it cites.
Approximate nearest neighbor search for low-dimensional queries
S. Har-Peled and N. Kumar · 2013
Later among the works it cites.
Optimal bounds for johnson-lindenstrauss transforms and streaming problems with subconstant error
T. S. Jayram and D. P. Woodruff · 2013
Later among the works it cites.
The National Academies Press, 2013
2013
Later among the works it cites.
Beyond locality-sensitive hashing
A. Andoni, P. Indyk, H. Nguyen, and I. Razenshteyn · 2014
Closest in time.