Search - Tree - CodeBus

Search - Tree - List

[MultiLanguage] Project3finishOK DL : 0: 动态规划实现的字典排序，构建最优二叉树，小心你的内存啊！-Dynamic Programming dictionary order to construct the optimal binary tree, carefully your memory ah!
Date : 2008-10-13 Size : 1.17mb User : hexin
[MultiLanguage] 二叉树建立 DL : 0: 输入并建立一颗二叉树,在以某种遍历顺序显示出来-importation and the establishment of a binary tree in order to traverse some displayed
Date : 2008-10-13 Size : 1.23kb User : 王丹
[MultiLanguage] 网的最小生成树问题 DL : 0: 网的最小生成树问题-net minimum spanning tree problem
Date : 2008-10-13 Size : 1.14kb User : 王丹
[MultiLanguage] 二叉树建立 DL : 0: 输入并建立一颗二叉树,在以某种遍历顺序显示出来-importation and the establishment of a binary tree in order to traverse some displayed
Date : 2025-12-20 Size : 1kb User : 王丹
[MultiLanguage] 网的最小生成树问题 DL : 0: 网的最小生成树问题-net minimum spanning tree problem
Date : 2025-12-20 Size : 1kb User : 王丹
[MultiLanguage] Project3finishOK DL : 0: 动态规划实现的字典排序，构建最优二叉树，小心你的内存啊！-Dynamic Programming dictionary order to construct the optimal binary tree, carefully your memory ah!
Date : 2025-12-20 Size : 1.17mb User : hexin
[MultiLanguage] XML_TreeCtrl DL : 0: 两个有关xml文件的操作类，可以完成基本的xml文件解析功能-Xml file two types of operation can be completed basic parsing xml document
Date : 2025-12-20 Size : 46kb User : qzl
[MultiLanguage] PcfgParser DL : 0: 1. 先打开规则库，读入规则集（可比较两个规则文件rule1.txt 和 rule2.txt的差异） 2. 选择经过分词和词性标注的文件，进行句法分析 3. 分析结果文件与测试文件在同一个目录下，文件后缀名为 .pcfg 4. 分析结束后，同时产生一个新的规则文件,后缀名为.new, 可以观察规则概率值和期望次数的变化 5. 分析结果逐个以树形图方式显示，如果一个句子有多个结果，在显示框中同时显示。-1. To open the rule base, reading into the rule set (which can compare two documents rule1.txt rules and rule2.txt difference) 2. Selection through word-of-speech tagging of documents and to carry out syntactic analysis 3. Analysis of the outcome document and test documents in the same directory, file name suffix. pcfg4. Analysis of the end of and at the same time create a new rules file, called the suffix. new, can observe the rules of probability values and expectations of changes in the number 5. Analysis of the results one by one to tree Figure show that if a sentence has more than a result, the display box at the same time show.
Date : 2025-12-20 Size : 52kb User : 董广宇
[MultiLanguage] NAryTrees DL : 0: Source code for NAry Tr-Source code for NAry Tree
Date : 2025-12-20 Size : 587kb User : haytham
[MultiLanguage] MSTParser.tar DL : 0: MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是所有依存关系的得分的总和，从而依存分析的问题转化成如何寻找最高得分的依存树。-Spanning tree is the largest MSTParser theory-based discriminant Parser interdependence. Section 1 will be scored as interdependent tree are all interdependent relationship between the sum of the scores, thus the analysis of interdependence into question how to find the highest scoring tree interdependence.
Date : 2025-12-20 Size : 410kb User : 周光有
[MultiLanguage] OBST DL : 0: Optimal binary search tr-Optimal binary search tree
Date : 2025-12-20 Size : 1kb User : abocs1984
[MultiLanguage] ID3 DL : 0: 决策树算法ID3的代码实验，编译后可直接使用的ID3代码-ID3 decision tree algorithm code experiments, compiled code can be directly used in ID3
Date : 2025-12-20 Size : 18kb User : xiaolin
[MultiLanguage] Dictory DL : 0: 用B-树作为查找存储结构，对中文单词进行哈希，用最长逆向匹配算法进行中文句段分词，实现中文词典以及分词。中文词典规模为十万八千多词汇。分词的正确率在90 以上。-Use the B-tree as storage structure , and hash the Chinese word while storing or searching. Use the longest reverse matching algorithm to split Chinese sentence to words. Chinese dictionaries scale of more than 108,000 words. Word correct rate of over 90 .
Date : 2025-12-20 Size : 780kb User : 康维鹏
[MultiLanguage] BinarySearchTree DL : 0: binary search tree (BST)
Date : 2025-12-20 Size : 1kb User : Stefano
[MultiLanguage] CFTree-a-SVM DL : 0: CF Tree Clustering and support vector machine on kdd Dataset
Date : 2025-12-20 Size : 2.24mb User : Taymaz
[MultiLanguage] ARB DL : 0: binary search tree in c++ using templates
Date : 2025-12-20 Size : 1kb User : amal
[MultiLanguage] ElCheepomemtweak DL : 0: latest coreboot code project with complete source tree
Date : 2018-07-12 Size : 1.32mb User : zhayejtd