Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Latent semantic indexing: a probabilistic analysis
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Applications of linear algebra in information retrieval and hypertext analysis
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Small distortion and volume preserving embeddings for planar and Euclidean metrics
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Information retrieval algorithms: a survey
SODA '97 Proceedings of the eighth 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
Random projection in dimensionality reduction: applications to image and text data
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Discrete Mathematics
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
An elementary proof of a theorem of Johnson and Lindenstrauss
Random Structures & Algorithms
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Learning Mixtures of Gaussians
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Data mining for hypertext: a tutorial survey
ACM SIGKDD Explorations Newsletter
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Journal of Computer and System Sciences - Special issu on PODS 2001
Fast and accurate text classification via multiple linear discriminant projections
The VLDB Journal — The International Journal on Very Large Data Bases
On scaling latent semantic indexing for large peer-to-peer systems
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
On the impossibility of dimension reduction in l1
Journal of the ACM (JACM)
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Monotone maps, sphericity and bounded second eigenvalue
Journal of Combinatorial Theory Series B
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Sphericity, cubicity, and edge clique covers of graphs
Discrete Applied Mathematics
Very sparse random projections
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Random projection and orthonormality for lossy image compression
Image and Vision Computing
Embeddings of surfaces, curves, and moving points in euclidean space
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Nearest-neighbor-preserving embeddings
ACM Transactions on Algorithms (TALG)
Very sparse stable random projections for dimension reduction in lα (0
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast and accurate text classification via multiple linear discriminant projections
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Hierarchical document classification using automatically generated hierarchy
Journal of Intelligent Information Systems
Detecting eye fixations by projection clustering
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Fast dimension reduction using Rademacher series on dual BCH codes
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Estimators and tail bounds for dimension reduction in lα (0
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Ultra-low-dimensional embeddings for doubling metrics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dense Fast Random Projections and Lean Walsh Transforms
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
Near Optimal Dimensionality Reductions That Preserve Volumes
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
Communications of the ACM
Note: Sphericity, cubicity, and edge clique covers of graphs
Discrete Applied Mathematics
Compressed sensing with cross validation
IEEE Transactions on Information Theory
Random Projection RBF Nets for Multidimensional Density Estimation
International Journal of Applied Mathematics and Computer Science - Issues in Fault Diagnosis and Fault Tolerant Control
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
Clustering by random projections
ICDM'07 Proceedings of the 7th industrial conference on Advances in data mining: theoretical aspects and applications
A video retrieval algorithm using random projections
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
An analysis of random projection for changeable and privacy-preserving biometric verification
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Global image registration by fast random projection
ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I
Sparser Johnson-Lindenstrauss transforms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An almost optimal unrestricted fast Johnson-Lindenstrauss transform
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Derandomization of dimensionality reduction and SDP based algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Randomized Algorithms for Matrices and Data
Foundations and Trends® in Machine Learning
Distributed high dimensional information theoretical image registration via random projections
Digital Signal Processing
An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Sparsity lower bounds for dimensionality reducing maps
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Sparser Johnson-Lindenstrauss Transforms
Journal of the ACM (JACM)
A random projection approach for estimation of the betweenness centrality measure
Intelligent Data Analysis
| Hi-index | 0.08 |