Pages that link to "Item:Q4542583"
From MaRDI portal
The following pages link to Approximate nearest neighbors: Towards removing the curse of dimensionality (Q4542583):
Displaying 50 items.
- Theoretical analysis of cross-validation for estimating the risk of the k-Nearest Neighbor classifier (Q4614090) (← links)
- Optimal Bounds for Johnson-Lindenstrauss Transformations (Q4614115) (← links)
- Constructing a High-Dimensional <i>k</i> NN-Graph Using a Z-Order Curve (Q4629532) (← links)
- (Q4633059) (← links)
- On the Distortion of Locality Sensitive Hashing (Q4634022) (← links)
- (Q4637072) (← links)
- (Q4638108) (← links)
- The Distortion of Locality Sensitive Hashing (Q4638109) (← links)
- Learning Binary Hash Codes for Large-Scale Image Search (Q4649217) (← links)
- An elementary proof of a theorem of Johnson and Lindenstrauss (Q4798181) (← links)
- Proximity-preserving labeling schemes (Q4948512) (← links)
- A survey on unsupervised outlier detection in high‐dimensional numerical data (Q4969851) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- The parallelism motifs of genomic data analysis (Q4993521) (← links)
- An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems (Q4997835) (← links)
- (Q5002756) (← links)
- Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
- A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique (Q5025039) (← links)
- Manifold Learning and Nonlinear Homogenization (Q5050434) (← links)
- Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering (Q5067443) (← links)
- Habituation as a neural algorithm for online odor discrimination (Q5073072) (← links)
- (Q5075744) (← links)
- Unifying Online and Offline Preference for Social Link Prediction (Q5084605) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- (Q5090388) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q5090394) (← links)
- (Q5091121) (← links)
- (Q5111221) (← links)
- (Q5111687) (← links)
- (Q5115825) (← links)
- (Q5121902) (← links)
- Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data (Q5135244) (← links)
- Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. (Q5136284) (← links)
- (Q5150577) (← links)
- (Q5159461) (← links)
- CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction* (Q5210429) (← links)
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
- Database Theory - ICDT 2005 (Q5316595) (← links)
- The Closest Pair Problem under the Hamming Metric (Q5323065) (← links)
- Visual Categorization with Random Projection (Q5380331) (← links)
- Efficient Associative Computation with Discrete Synapses (Q5380385) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
- Automata, Languages and Programming (Q5466520) (← links)
- Approximating Minimization Diagrams and Generalized Proximity Search (Q5502175) (← links)
- Beta Random Projection (Q5503786) (← links)
- Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)
- (Q5743459) (← links)
- (Q5743469) (← links)
- Conservative confidence intervals on multiple correlation coefficient for high-dimensional elliptical data using random projection methodology (Q5861273) (← links)
- Local Density Estimation in High Dimensions (Q5870349) (← links)