ML Anthology

Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree

Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh
ICCV 2001 pp. 446-453
doi:10.1109/ICCV.2001.10071 /iccv/2001/chen2001iccv-fast/
ICCV Semantic Scholar

Cite

Text

Chen et al. "Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree." IEEE/CVF International Conference on Computer Vision, 2001. doi:10.1109/ICCV.2001.10071

Markdown

[Chen et al. "Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree." IEEE/CVF International Conference on Computer Vision, 2001.](https://mlanthology.org/iccv/2001/chen2001iccv-fast/) doi:10.1109/ICCV.2001.10071

BibTeX

@inproceedings{chen2001iccv-fast,
  title     = {{Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree}},
  author    = {Chen, Yong-Sheng and Hung, Yi-Ping and Fuh, Chiou-Shann},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {2001},
  pages     = {446-453},
  doi       = {10.1109/ICCV.2001.10071},
  url       = {https://mlanthology.org/iccv/2001/chen2001iccv-fast/}
}