QsRank: Query-Sensitive Hash Code Ranking for Efficient ∊-Neighbor Search

CVPR 2012 pp. 2058-2065

doi:10.1109/CVPR.2012.6247910 /cvpr/2012/zhang2012cvpr-qsrank/

Cite

Text

Zhang et al. "QsRank: Query-Sensitive Hash Code Ranking for Efficient ∊-Neighbor Search." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012. doi:10.1109/CVPR.2012.6247910

Markdown

[Zhang et al. "QsRank: Query-Sensitive Hash Code Ranking for Efficient ∊-Neighbor Search." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012.](https://mlanthology.org/cvpr/2012/zhang2012cvpr-qsrank/) doi:10.1109/CVPR.2012.6247910

BibTeX

@inproceedings{zhang2012cvpr-qsrank,
  title     = {{QsRank: Query-Sensitive Hash Code Ranking for Efficient ∊-Neighbor Search}},
  author    = {Zhang, Xiao and Zhang, Lei and Shum, Heung-Yeung},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2012},
  pages     = {2058-2065},
  doi       = {10.1109/CVPR.2012.6247910},
  url       = {https://mlanthology.org/cvpr/2012/zhang2012cvpr-qsrank/}
}