Nearest-neighbor-preserving embeddings
暂无分享,去创建一个
Piotr Indyk | Assaf Naor | P. Indyk | A. Naor
[1] M. Talagrand. Majorizing measures: the generic chaining , 1996 .
[3] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[4] Sariel Har-Peled. A replacement for Voronoi diagrams of near linear size , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[5] R. Durrett. Probability: Theory and Examples , 1993 .
[6] Anupam Gupta,et al. Cuts, Trees and ℓ1-Embeddings of Graphs* , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[7] Rafail Ostrovsky,et al. Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.
[8] Alex Samorodnitsky,et al. Random weighting, asymptotic counting, and inverse isoperimetry , 2005, Electron. Colloquium Comput. Complex..
[9] Trevor Darrell,et al. Nearest-Neighbor Searching and Metric Space Dimensions , 2006 .
[10] Peter Frankl,et al. The Johnson-Lindenstrauss lemma and the sphericity of some graphs , 1987, J. Comb. Theory, Ser. B.
[11] M. Talagrand. Regularity of gaussian processes , 1987 .
[12] Dimitris Achlioptas,et al. Database-friendly random projections: Johnson-Lindenstrauss with binary coins , 2003, J. Comput. Syst. Sci..
[13] M. Talagrand,et al. Probability in Banach Spaces: Isoperimetry and Processes , 1991 .
[14] T. Laakso. Ahlfors Q-regular spaces with arbitrary Q > 1 admitting weak Poincaré inequality , 2000 .
[15] Sunil Arya,et al. Linear-size approximate voronoi diagrams , 2002, SODA '02.
[16] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[17] Piotr Indyk. On approximate nearest neighbors in non-Euclidean spaces , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[18] M. Talagrand. Majorizing measures without measures , 2001 .
[19] G. Schechtman. A remark concerning the dependence on ɛ in dvoretzky's theorem , 1989 .
[20] Artem Zvavitch,et al. Supremum of a Process in Terms of Trees , 2003 .
[21] J. R. Lee,et al. Embedding the diamond graph in Lp and dimension reduction in L1 , 2004, math/0407520.
[22] Rae Baxter,et al. Acknowledgments.-The authors would like to , 1982 .
[23] U. Lang,et al. Bilipschitz Embeddings of Metric Spaces into Space Forms , 2001 .
[24] James R. Lee,et al. Metric Structures in L1: Dimension, Snowflakes, and Average Distortion , 2004, LATIN.
[25] Alex Samorodnitsky,et al. The distance approach to approximate combinatorial counting , 2000 .
[26] M. Talagrand,et al. Probability in Banach spaces , 1991 .
[27] S. Konyagin,et al. On measures with the doubling condition , 1988 .
[28] Y. Gordon. On Milman's inequality and random subspaces which escape through a mesh in ℝ n , 1988 .
[29] J. Heinonen. Lectures on Analysis on Metric Spaces , 2000 .
[30] B. Klartaga,et al. Empirical processes and random projections , 2004 .
[31] James R. Lee,et al. Metric structures in L1: dimension, snowflakes, and average distortion , 2005, Eur. J. Comb..
[32] I. Bárány. LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) , 2003 .
[33] Robert Krauthgamer,et al. Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[34] J. Matousek,et al. On variants of the Johnson–Lindenstrauss lemma , 2008 .
[35] IndykPiotr. Stable distributions, pseudorandom generators, embeddings, and data stream computation , 2006 .
[36] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[37] Sariel Har-Peled,et al. Fast construction of nets in low dimensional metrics, and their applications , 2004, SCG.
[38] Noga Alon,et al. Problems and results in extremal combinatorics--I , 2003, Discret. Math..
[39] M. Talagrand. The Generic Chaining , 2005 .
[40] Kenneth Ward Church,et al. Nonlinear Estimators and Tail Bounds for Dimension Reduction in l1 Using Cauchy Random Projections , 2006, J. Mach. Learn. Res..
[41] Sanjoy Dasgupta,et al. An elementary proof of a theorem of Johnson and Lindenstrauss , 2003, Random Struct. Algorithms.
[42] Avner Magen,et al. Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications , 2002, RANDOM.
[43] Alexander Barvinok. Approximate counting via random optimization , 1997 .
[44] Robert Krauthgamer,et al. Navigating nets: simple algorithms for proximity search , 2004, SODA '04.
[45] G. Schechtman. Two observations regarding embedding subsets of Euclidean spaces in normed spaces , 2006 .