1) K-D tree
K-D树
1.
K-means clustering algorithm based on k-d tree;
基于k-d树的k-means聚类方法
2.
Airborne LIDAR point cloud data filter based on k-d tree
基于k-d树的机载LIDAR点云滤波处理
3.
First,adopting the frequency method in probability statictics,the noise data could be found from the scattered data;then,through the K-D tree space estblished based on the 3D data,the k nearest points around noise point were found and through the information of these k points,the real informatio.
根据概率统计学中的频数法从大量的离散三维数据点云中找到噪声点,然后基于三维数据点云所建立的K-D树空间数据结构,找到噪声点周围的k个最近点,根据噪声点周边k个最近点的信息对噪声点处的真实信息进行恢复。
2) K-D-tree
K-D树
1.
Tree is one of the most effective method to build multidimensional index in database system,k-d-tree and R-tree are all some popular structures.
树形结构一直都是数据库系统中建立多维索引最有效的方法之一,其中比较流行的有k-d树,R树等。
3) optimal k-d tree
优化k-d树
4) bounded k-d tree
有界k-d树
1.
Algorithm for searching nearest-neighbor based on the bounded k-d tree;
基于有界k-d树的最近点搜索算法
5) advanced k-d tree
改进k-d树
6) k-tree
k-树
1.
It used symbol to express circuit element s parameters and solved the k-trees of the network,therefore,the symbolic expression of node voltage variables in Node Matrix Equation can be evaluated.
该方法直接将电力网络元件的参数进行符号表达,通过求解网络的k-树,有效地计算出电力网络节点电压方程中各变量的符号表达式。
2.
By this method the parameters of components in power network are directly expressed by symbols, and through the solution of the k-tree of the network the symbolic expressions of nodal voltages in node voltage e.
该算法直接将电力网络元件的参数进行符号表达,通过求解网络的k-树有效地生成电力网络节点电压方程中各节点电压的符号表达式,进而获得潮流解;并通过采用广义树法系统地生成复杂网络的树组,解决生成网络全部k-树时计算量和存储量随网络顶点数目的增加而过快增长的难点,有效地提高了算法的计算速度。
3.
This paper gives an K-tree algorithm for computing K-terminal reliability in complex networks.
给出了计算网络K-终端可靠性的一种K-树拆法,用这种方法,计算复杂网络K-终端可靠性时,不用求出全部K-树,从而有效地提高了计算速度。
补充资料：(S)-10-羟基喜树碱
分子式：C20H16N2O5
分子量：364.35
CAS号：19685-09-7
性质：密度1.60。熔点265-270°C。
分子量：364.35
CAS号：19685-09-7
性质：密度1.60。熔点265-270°C。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条