Fast sketch-based recovery of correlation outliers
From MaRDI portal
(Redirected from Publication:3305358)
Recommendations
Cites work
- (1 + eps)-Approximate Sparse Recovery
- A Faster Subquadratic Algorithm for Finding Outlier Correlations
- Approximate sparse recovery: optimizing time and measurements
- Compressed sensing
- Extensions of Lipschitz mappings into a Hilbert space
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- scientific article; zbMATH DE number 1256715 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- Linear-time encodable and decodable error-correcting codes
- Sparser Johnson-Lindenstrauss transforms
Cited in
(9)- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
- Top-k correlation computation
- Checkpoint evolution for volatile correlation computing
- scientific article; zbMATH DE number 1934559 (Why is no real title available?)
- A faster subquadratic algorithm for finding outlier correlations
- A Faster Subquadratic Algorithm for Finding Outlier Correlations
- scientific article; zbMATH DE number 6846423 (Why is no real title available?)
- A partition based method for finding highly correlated pairs
- Adaptive correlation analysis in stream time series with sliding windows
This page was built for publication: Fast sketch-based recovery of correlation outliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305358)