Uncertainty principles and signal recovery
SIAM Journal on Applied Mathematics
Expanders that beat the eigenvalue bound: explicit construction and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Dimensionality reduction techniques for proximity problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Database-friendly random projections
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lattice problems and norm embeddings
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Uncertainty principles and ideal atomic decomposition
IEEE Transactions on Information Theory
Sparse representations in unions of bases
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On quasi-orthogonal signatures for CDMA systems
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Fast dimension reduction using Rademacher series on dual BCH codes
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Explicit constructions for compressed sensing of sparse signals
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Earth mover distance over high-dimensional spaces
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Almost Euclidean subspaces of ℓN1 via expander codes
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Euclidean Sections of $\ell_1^N$ with Sublinear Randomness and Error-Correction over the Reals
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Detecting the most unusual part of two- and three-dimensional digital images
Pattern Recognition
Explicit construction of a small epsilon-net for linear threshold functions
Proceedings of the forty-first annual ACM symposium on Theory of computing
MAMECTIS'08 Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Detection of Unusual Objects and Temporal Patterns in EEG Video Recordings
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Detecting the most unusual part of a digital image
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
A locality-sensitive hash for real vectors
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Almost-Euclidean subspaces of l1Nvia tensor products: a simple approach to randomness reduction
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Deterministic construction of a high dimensional lp section in l1n for any p
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions
SIAM Journal on Computing
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
Journal of the ACM (JACM)
Hi-index | 0.00 |
We give an explicit construction of a constant distortion embedding F of l2n into l1m, with m=n1+o(1).As a bonus, our embedding also has good computational properties: for any input x, Fx can be computed in n1+o(1) time.The previously known mappings required Ω(n2) evaluation time.