咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献

馆藏范围

  • 1 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 电气工程
    • 1 篇 计算机科学与技术...

主题

  • 1 篇 computer science
  • 1 篇 runtime
  • 1 篇 approximation al...
  • 1 篇 nearest neighbor...
  • 1 篇 machine learing
  • 1 篇 data structure a...
  • 1 篇 data mining
  • 1 篇 computed tomogra...
  • 1 篇 navigation
  • 1 篇 cover tree
  • 1 篇 data structures

机构

  • 1 篇 chongqing univ k...
  • 1 篇 chongqing univ c...
  • 1 篇 hunan univ coll ...
  • 1 篇 pinduoduo co peo...
  • 1 篇 univ auckland de...
  • 1 篇 shanghai jiao to...

作者

  • 1 篇 zhao kaiqi
  • 1 篇 nie mengdie
  • 1 篇 wang zhi-jie
  • 1 篇 yao bin
  • 1 篇 quan zhe

语言

  • 1 篇 英文
检索条件"主题词=data structure and algorithms"
1 条 记 录,以下是1-10 订阅
排序:
Cover Trees Revisited: Exploiting Unused Distance and Direction Information
收藏 引用
IEEE TRANSACTIONS ON KNOWLEDGE AND data ENGINEERING 2023年 第11期35卷 11231-11245页
作者: Wang, Zhi-Jie Nie, Mengdie Zhao, Kaiqi Quan, Zhe Yao, Bin Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Chongqing Univ Key Lab Dependable Serv Comp Cyber Phys Soc Minist Educ Chongqing 400044 Peoples R China Pinduoduo Co Shanghai 200051 Peoples R China Univ Auckland Dept Comp Sci Auckland 1010 New Zealand Hunan Univ Coll Comp Sci Changsha 410012 Peoples R China Shanghai Jiao Tong Univ Dept Comp Sci Shanghai 200240 Peoples R China
The cover tree (CT) and its improved version are hierarchical data structures that simplified navigating nets while maintaining good runtime guarantees. They can perform nearest neighbor search in logarithmic time and... 详细信息
来源: 评论