1) pruning method
剪枝方法
1.
Infulence of pruning methods on the amount of stumpage of Europe and the United States fast-growing poplar 107
不同剪枝方法对欧美107速生杨立木蓄积量的影响
2) geometric pruning method
几何剪枝方法
1.
A simple but efficient geometric pruning method is presented for the directional projection problem of B-spline surfaces.
该方法充分利用了B样条函数的凸包性,同时结合B样条函数稳定可靠的分裂算法给出了相应的几何剪枝方法。
3) pruning algorithm
剪枝算法
1.
Fast pruning algorithm for designing sparse least squares support vector machine
构造稀疏最小二乘支持向量机的快速剪枝算法
2.
Improved pruning algorithms for sparse least squares support vector regression machine
关于稀疏最小二乘支持向量回归机的改进剪枝算法
3.
In order to solve the problem,LSSVM integrates with sequential minimal optimization(SMO) algorithm and a modified pruning algorithm imposes sparseness upon the solution of LSSVM integrated SMO algorithms.
针对最小二乘支持向量机(LSSVM)仅考虑等式约束,失去了支持向量机(SVM)解的稀疏性,影响了二次学习效率的问题,把最小二乘支持向量机与序列最小优化算法(SMO)相结合,后者应用改进的剪枝算法对解进行稀疏化处理,解决了上述问题;算法与最小二乘支持向量机相比降低了计算的复杂度,提高了计算精度。
4) method of branching-cutting
剪枝法
1.
This paper presents a general algorithm for searching Costas arrays based on the method of branching-cutting, which cuts off all the branches not satisfying the conditions for Costas arrays so that not only a large number of unnecessary backtrackings are avoided but also Costas arrays are generated at the same time without any additional judgment.
给出了一种基于剪枝法的Costas阵列通用搜索算法 。
5) PLS-Pruning
PLS剪枝法
6) K-Diameter-Cut algorithm
K-剪枝算法
1.
The algorithm was based on the greedy algorithm using K-Diameter-Cut algorithm in the network topology map to identify some key routers.
该算法是以贪心算法为基础,利用K-剪枝算法在网络拓扑图中找出一些关键的路由器,利用这些路由器也就是只让tracers对过往的数据包按照着色包标记算法进行标记,这样不但减少了重构路径所需的数据包数,降低了路径误报率,提高了追踪到攻击者的速度,而且大大减轻了路由器标记的负担,从而能够迅速准确地找到攻击源。
补充资料：剪枝
1.谓修整树木的枝丫。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条