Near-optimal sample complexity bounds for circulant binary embedding - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Samet Oymak, Christos Thrampoulidis, Babak Hassibi. Near-optimal sample complexity bounds for circulant binary embedding. In 2017 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2017, New Orleans, LA, USA, March 5-9, 2017. pages 6359-6363, IEEE, 2017. [doi]

This author has not been identified. Look up 'Samet Oymak' in GoogleThis author has not been identified. Look up 'Christos Thrampoulidis' in GoogleThis author has not been identified. Look up 'Babak Hassibi' in Google

runs on WebDSL