Pages that link to "Item:Q2796401"
From MaRDI portal
The following pages link to Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401):
Displaying 16 items.
- Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
- High-dimensional approximate \(r\)-nets (Q1987244) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Fast sketch-based recovery of correlation outliers (Q3305358) (← links)
- A Faster Subquadratic Algorithm for Finding Outlier Correlations (Q4554359) (← links)
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← links)
- On the hardness of learning sparse parities (Q4606280) (← links)
- (Q4606323) (← links)
- Quickest Search and Learning Over Correlated Sequences: Theory and Application (Q4628224) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- (Q5121902) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
- Properly learning decision trees in almost polynomial time (Q6551255) (← links)
