Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6560182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem |
scientific article; zbMATH DE number 6560182 |
Statements
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
0 references
0 references
Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (English)
0 references
0.825212299823761
0 references
0.8249551653862
0 references
0.8147827982902527
0 references
0.7917995452880859
0 references
0.7914720177650452
0 references
