Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:02, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem |
scientific article |
Statements
Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (English)
0 references
24 March 2016
0 references
correlations
0 references
approximate closest pair
0 references
asymmetric embeddings
0 references
learning juntas
0 references
locality sensitive hashing
0 references
metric embedding
0 references
nearest neighbor
0 references
parity with noise
0 references
