Pages that link to "Item:Q5281372"
From MaRDI portal
The following pages link to Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem (Q5281372):
Displaying 10 items.
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- ForestDSH: a universal hash design for discrete probability distributions (Q2036729) (← links)
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401) (← links)
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← links)
- (Q5111221) (← links)
- (Q5115825) (← links)
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
- Asymptotics and improvements of sieving for codes (Q6637718) (← links)
