Dimitris Achlioptas  Home/Search
Context Related
| microsoft.com/~optas/papers/jl.ps From: microsoft.com/~optas/work (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space | where k is logarithmic in n and independent of d | so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the n points onto a random k-dimensional hyperplane. We give a novel construction of the embedding, suitable for database applications,... (Update)
Similar documents based on text: More All
0.1: Dimensionality Reductions that Preserve Volumes and Distance to.. - Magen (2001) (Correct)
0.0: Fast Computation of Low Rank Matrix Approximations - Achlioptas, McSherry (2001) (Correct)
0.0: Balance and Filtering in Structured Satisfiable Problems - Kautz, Ruan, Achlioptas, .. (2001) (Correct)
BibTeX entry: (Update)
Dimitris Achlioptas. Database-friendly random projections. In roceedings of PODS 01, pages 274-281, 2001. http://citeseer.ist.psu.edu/achlioptas01databasefriendly.html More
@inproceedings{ achlioptas01databasefriendly,
author = "Dimitris Achlioptas",
title = "Database-friendly random projections",
booktitle = "Symposium on Principles of Database Systems",
year = "2001",
url = "citeseer.ist.psu.edu/achlioptas01databasefriendly.html" }
Citations (may not include all citations):227 An elementary proof of the Johnson-Lindenstrauss lemma - Dasgupta, Gupta - 1999
170 The geometry of graphs and some of its algorithmic applicati.. - Linial, London et al. - 1995
165 Approximate nearest neighbors: towards removing the curse of.. - Indyk, Motwani - 1998
91 Two algorithms for nearest-neighbor search in high dimension.. - Kleinberg - 1997
64 Latent semantic indexing: A probabilistic analysis - Papadimitriou, Raghavan et al. - 1998
48 embeddings and data stream computation (context) - Indyk, pseudorandom - 2000
35 The Johnson-Lindenstrauss lemma and the sphericity of some g.. (context) - Frankl, Maehara - 1988
32 Learning mixtures of Gaussians (context) - Dasgupta - 1999
17 An algorithmic theory of learning: robust concepts and rando.. (context) - Vempala, Arriaga - 1999
16 Clustering for edge-cost minimization - Schulman - 2000
12 A random sampling based algorithm for learning the intersect.. - Vempala - 1997
8 Learning mixtures of arbitrary Gaussians - Arora, Kannan - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.microsoft.com/~optas/work.html): More
Generating Satisfiable Problem Instances - Achlioptas, Kautz (2000) (Correct)
Random Constraint Satisfaction: A More Accurate Picture - Achlioptas, Kirousis.. (1997) (Correct)
The Analysis of a List-Coloring Algorithm on a Random Graph .. - Achlioptas, Molloy (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC