二叉树

提出了一种基于二叉树的多类支持向量机（SVM）分类方法，建立用群体神经元的放电频率模式预测手臂运动方向的模型。

A multi-class support vector machines ( SVM ) algorithm of a binary tree recognition strategy is used to predict the movement direction with the firing rate patterns of neural ensemble .

核心思想是对源IP、目的IP进行降维处理后，再用排序二叉树组织复合IP，通过复合IP与流标签来进行分类。

The main idea is to reduce the dimension by combing the source IP and destination IP , and then organize composite , IP with sorted binary tree . The classification will be done based composite IP and flow label .

基于二叉树型分层BP模型的板形模式识别

Flatness pattern recognition based on a binary tree hierarchical BP model

这是数据结构中的描述二叉树的一个JAVA程序。

This data structure is the description of a binary tree JAVA program .

基于二叉树编码遗传算法的SOA服务选择

SOA services selection based on binary-tree-coding genetic algorithm

一种基于二叉树的Cache一致性目录方法

A Binary Tree Based Cache Coherence Directory Scheme

基于二叉树多层分类SVM的脱机手写体汉字识别

A off-Line Handwritten Chinese Character Recognition Based on the Binary Tree of SVM Multi-Classification

利用一对一的分类策略和二叉树构造多类SVM分类器。

One versus one classification strategy and a binary tree structure multi-classes SVM classifier are used .

本文提出的基于二叉树的HTML到XML的转换方法可以有效地处理HTML中三种典型的错误。

The convertion method this paper presents is based on binary tree , can handle three typical errors in HTML .

用伪二叉树法则构造多目标Pareto最优解集的方法

An Approach to Constructing Multi-Objective Pareto Optimal Solutions Using Pseudo Binary Tree 's Rule

二叉树与RSA相结合进行数据加密及其在数据传输中的应用

Realization of Uniting Binary Tree with RSA to Encrypt Data and Its Application in Data Transport

一种基于二叉树的快速Delaunay三角网生成算法

An Algorithm for Quick Generating of Delaunay Triangular Net Based on Binary Tree

运动学方面用二叉树的数据结构描述机器人各杆件属性和相互间连接关系，建立了基于MATLAB的运动学仿真工具箱。

In kinematics , binary tree data structure is used to describe links ' characteristics and mutual connections . A kinematics simulation toolbox for MATLAB is established .

提出了基于二叉树和自组织公钥体制的密钥管理方案在MANET中的应用；

An efficient key management solution was presented in MANET based on binary-tree and self-organize theory .

针对P2P网络中资源查找以及其自身存在的问题，提出了一种基于二叉树的P2P网络模型。

Focusing on the problems of the resource searching in P2P network , a P2P network model based on strictly binary tree is proposed .

针对数字信号调制模式识别问题，提出了运用高阶累积量和二叉树支持向量机（SVM）进行自动识别的算法。

Applying high order cumulants and support vector machines ( SVM ), an algorithm is proposed for automatic recognition of digital communication signals .

本文定义了一个相对完备的视频类型分层表示，分析并提取一系列与类型相关的时空域特征，并提出使用局部和全局优化的多类SVM二叉树提高分类精度。

We define a relatively comprehensive video genre ontology , analyze and extract a series of spatial and temporal features related to video genres .

满二叉树的Laplacian特征值

The Laplacian Eigenvalues of Full Binary Tree

已经提出的索引方法还包括多维二叉树算法和Cell索引算法、Quad树、k-d树以及Grid树索引算法等等。

Some others indexing algorithm include Quard tree , k-d tree , Grid tree , multi-binary tree and cell indexing algorithm , ect .

首先从Black-Scholes微分方程引出期权定价二叉树模型。

First , we leads binary tree model from the Black-Scholes option pricing differential equations .

介绍二叉树h－v画法的概念，给出二叉树的一个线性时间h－v画树算法，并给出一个应用实例。

The concept of h-v drawing of a binary tree is described . A linear time h-v drawing algorithm of binary trees is presented . An application instance is given too .

基于线索二叉树的WBS算法

WBS Algorithm Based on Threaded Binary Tree

在实际的研究中，对二叉树结构进行空间深度限制后，其遗传算法可以用一个有限状态空间的Markov链来描述。

If the space of the bintree structure is limited by the depth of the bintree , the algorithm can be described with Markov chains of finite state space .

带状方程组二叉树MIMD算法

MIMD Algorithm on Binary Tree Model for Band System of Linear Algebraic Equations

通过扩展Cox、Ross和Rubinstein（1979）的二叉树模型，说明了离散时间下实物期权定价的方法及其在考虑了管理灵活性评估中的信息成本时在R&D项目评估中的应用。

We explain the real option pricing method in discrete time and its application in R & D project .

分析线状目标的结构特点，构造了弯曲Douglas二叉树对其进行空间表达。

On the basis of analyzing the line object structure , the study presents curve Douglas binary tree to represent it .

通过对该逻辑树构造二叉树，节点可以获得一个局部地址（kinship地址）。

By the binary tree generated by this logic tree , the node can get a local address named by Kinship Address .

该算法首先使用二叉树进行多类决策，将原始分类数据分解成3个二类分类问题，然后利用SVM进行二类分类，使3个分类超平面得到优化。

This algorithm uses binary tree to construct the multi-class frame by decomposing the problem into three 2-class classification problems , then uses Support Vector Machine optimizing the three hyperplanes .

本文利用二叉树对多剖切体情况下的Stencil参照值的进行了合并，使得在每一切层上的绘制次数达到最少。

The rendering time is decreased to the minimum due to the stencil reference combination by using the binary tree .

与二叉树枚举计数相关的最有名的就是Catalan数。

The most famous result related to the counting of binary tree enumeration is Catalan number .