go top

k-d tree 添加释义

网络释义专业释义英英释义

短语

bounded k-d tree 有界k

optimal k-d tree 优化k

advanced k-d tree 改进k

  • k-d树

·2,447,543篇论文数据,部分数据来源于NoteExpress

K-d tree

  • abstract: In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.

以上来源于: WordNet

双语例句

  • As for case searching algorithms, this paper presents an improved K-D tree algorithm based on the characteristics of XML documents and K-D tree algorithms and implements the algorithm.

    根据XML文件结构特点K - D算法提出改进K - D算法作为系统的案例检索算法得到了实现

    youdao

  • The thesis analyzes the advantages and drawbacks of the two kinds of algorithms and proposes a mixture model which introduces the feature driven methods (K-D Forest) into vocabulary tree.

    本文分析了方法优缺点后,提出了特征驱动方法(K - D森林)引入词汇模型混合模型。

    youdao

更多双语例句
$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定