Near-optimal sample complexity bounds for circulant binary embedding

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]

@inproceedings{OymakTH17,
  title = {Near-optimal sample complexity bounds for circulant binary embedding},
  author = {Samet Oymak and Christos Thrampoulidis and Babak Hassibi},
  year = {2017},
  doi = {10.1109/ICASSP.2017.7953380},
  url = {https://doi.org/10.1109/ICASSP.2017.7953380},
  researchr = {https://researchr.org/publication/OymakTH17},
  cites = {0},
  citedby = {0},
  pages = {6359-6363},
  booktitle = {2017 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2017, New Orleans, LA, USA, March 5-9, 2017},
  publisher = {IEEE},
  isbn = {978-1-5090-4117-6},
}