您要查找的是不是:
- The model is a generalization of conventional binary tree algorithm. 模型是传统的二元树形算法的推广。
- Visual SEEK system developed by Columbia university, this system construct index with binary tree algorithm and retrieval based on spatial information. 哥伦比亚大学开发的VisualSeek系统,采用了二进树算法构造索引,支持空间位置关系的查询。
- After the discussion of traditional binary tree algorithm, one registering algorithm based on the binary exponential back-off (BEB) is proposed. 根据传统二叉树算法,提出一种基于二进制指数随机后退(BEB)算法的注册方法。
- traversing binary tree algorithm 二叉树遍历算法
- binary tree algorithm 二叉树法
- An algorithm that traverses a general binary tree will have complexity O( 2 N ). 一个算法,遍历一般二叉树将复杂性为O(2 N)段。
- Write a function to find the depth of a binary tree. 写个程序找到一个二叉树的深度。
- And above the level established by the binary tree traversal. 并对上面建立的二叉树按层次遍历。
- The point is that polygons are stored in a binary tree. 多边形是以点的形式在二叉树中存储的。
- The multiclass SVM methods based on binary tree are proposed. 摘要提出一种新的基于二叉树结构的支持向量(SVM)多类分类算法。
- The concept of in-place quicksort binary tree has great theoretical and practical reference value to the research and improvement of sorting algorithm. 原地快速排序二叉树的概念对排序算法的研究和改进具有很好的理论和实用参考价值。
- The count is then constructed into a binary tree using the Huffman algorithm to generate an optimized bit length coding. 然后,将该次数数字转化成二进制树状结构,再运用霍夫曼运算法则生成经优化的位长编码。
- Through the computer simulation, the results show that BEB algorithm has lower registration time delay than binary tree, can be implemented easily and efficiently. 通过计算机仿真分析,BEB算法实现简单,具有较高的注册效率和较低的注册时延。
- Using Binary tree to save the text in sepecific file and catalogue, Delphi. 用二叉树的算法对指定目录下的文件和目录以格式化的方法保存。
- The new algorithm adopts the binary slotted query tree algorithm, which largely reduces both query frequency and data iteration, and also improves identification efficiency. 该算法利用二时隙的方法,使阅读器的询问次数和标签识别所需的数据流大大减少,提高了标签的识别效率。
- Based on SPKI technology, proposing multicast distributed access control system: MDAC, as wall as, proposing a delegation certificate path(DCP) searching algorithm based on binary tree. 基于SPKI技术提出了组播分布式访问控制系统MDAC,并提出了基于二叉授权委托树的委托证书路径(DCP)查找算法。
- Using this algorithm, the problems, that the single tree algorithm cannot adapt to nonstationary signals and the double tree algorithm has strict binary restriction, are solved. 利用此算法进行小波包分解可以解决以往分解算法如单树算法无法进行时频分解而双树算法只能进行二叉树分解的问题。
- Very good Java Applet used to animate Inserting, Deleting and Searching (Preorder & Postorder algorithm) nodes in Binary Trees. You can use and redistribute the (译):非常好的Java Applet的用于动画插入,删除和搜索(前序和后序算法)节点二叉树。
- Fenwick tree algorithm source code integrity, and can be used directly. (译):域树算法源代码完整,并可以直接使用。
- How would you print out the data in a binary tree, level by level, starting at the top? 你将怎样以水平打印二叉树数据,水平,在顶开始?