搜索资源列表
Project3finishOK
- 动态规划实现的字典排序，构建最优二叉树，小心你的内存啊！-Dynamic Programming dictionary order to construct the optimal binary tree, carefully your memory ah!
二叉树建立
- 输入并建立一颗二叉树,在以某种遍历顺序显示出来-importation and the establishment of a binary tree in order to traverse some displayed
网的最小生成树问题
- 网的最小生成树问题-net minimum spanning tree problem
ID3.rar
- 决策树算法ID3的代码实验，编译后可直接使用的ID3代码,ID3 decision tree algorithm code experiments, compiled code can be directly used in ID3
NArytrees
- Source code for NAry Tr-Source code for NAry tree
MSTParser.tar
- MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和，从而依存分析的问题转化成如何寻找最高得分的依存树。-Spanning tree is the largest MSTParser theory-based discriminant Parser interdependence. Section 1 will be scored as interdependent tree are all interdependent re
OBST
- Optimal binary search tr-Optimal binary search tree
Dictory
- 用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 word
BinarySearchtree
- binary search tree (BST)
CFtree-a-SVM
- CF tree Clustering and support vector machine on kdd Dataset
ARB
- binary search tree in c++ using templates