Instruct: Given a paper title, retrieve paper titles that are cited by the given paper.
Query: random projection and hashing .
Improved Approximation Algorithms for Large Matrices via Random Projections
Fast probabilistic collision checking for sampling-based motion planning using locality-sensitive hashing
Hashing on Nonlinear Manifolds
Hash functions: Theory, attacks, and applications
Discrete Graph Hashing
A Monte Carlo algorithm for fast projective clustering
Sloppy Hashing and Self-Organizing Clusters
Supervised Discrete Hashing
Subspace Outlier Detection in Linear Time with Randomized Hashing
Scalable and Sustainable Deep Learning via Randomized Hashing
ATLAS: a probabilistic algorithm for high dimensional similarity search
Abelian square-free dithering for iterated hash functions
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
Fast and Orthogonal Locality Preserving Projections for Dimensionality Reduction
Multiprocessor Hash-Based Join Algorithms
Hashing for Similarity Search: A Survey
Random projection in dimensionality reduction: applications to image and text data
Geometric approximation via coresets
Semi-Supervised Hashing for Large-Scale Search
Deep Discrete Supervised Hashing
Detecting kernel-level rootkits through binary analysis
Initial explorations on using CRFs for Turkish Named Entity Recognition
OntoSphere: more than a 3D ontology visualization tool
Nuclear threat detection with mobile distributed sensor networks
Monte Carlo sampling methods using Markov chains and their applications