在线客服: 点击这里给我发消息  新用户使用步骤:会员注册→充值→重新登入→进入资源
标题:Online Nearest Neighbor Search Using Hamming Weight Trees.
时间:2019-07-16 16:40:24
DOI:10.1109/TPAMI.2019.2902391
PMID:30843799
作者:Eghbali, Sepehr;Ashtiani, Hassan;Tahvildari, Ladan
出版源: IEEE Transactions on Pattern Analysis and Machi... ,PP (99) :1-1
摘要:Nearest neighbor search is a basic and recurring proximity problem that has been studied for several decades. The goal is to preprocess a dataset of points...
大小:1200 kb
页数:13 PAGES
下载: 点击下载
预览:

浏览器不支持嵌入PDF阅读,打开新页面在线阅读

目录:
  • Introduction
  • Background Review
  • Hamming Weight Tree
    • Depth One Tree
    • Hamming Weight Tree on Substrings
    • Storage and Computational Costs
    • K Nearest Neighbors Search
  • Angular Nearest Neighbor Search
  • Experimental Results
    • Datasets
    • Results
      • Effect of Threshold Value
      • HWT vs Linear Scan
      • HWT vs MIH
      • HWT vs tree search algorithms
  • Conclusion
  • Appendix A: Proofs
    • Proof of Theorem 1
  • References
  • Biographies
    • Sepehr Eghbali
    • Hassan Ashtiani
    • Ladan Tahvildari

本页内容由网络收集而来,版权归原创者所有,如有侵权请及时联系