Login / Signup
A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes.
Sameer Pawar
Kannan Ramchandran
Published in:
ISIT (2014)
Keyphrases
</>
sample complexity
lower bound
pac learning
data sets
data mining
high dimensional
vc dimension
decision lists
supervised learning
theoretical analysis