资源列表
LZW_Demo
- lzw压缩算法源码，LZW压缩算法和RLE压缩算法的实现源码及Demo。 本Demo未经过严格测试，请先保存待压缩文件再进行压缩测试。-lzw source compression algorithm, LZW compression algorithm and implementation of RLE compression algorithm source code and Demo. This Demo has not been rigorously tested, first sa
biaodashiqiuzhi
- 自己编写的堆栈，单链表实现，并用于表达式求值（中缀转后缀、后缀求值）-I have written a stack, single linked list implementation, and for expression uation (infix turn suffix, suffix uation)
svmlight
- Joachims的SVM-light工具包 里面含有 两个.exe文件svm_classify.exe svm_learn.exe 可以实现Transductive SVM用Anton s Matlab interface to SVM light 使用会更方便-Joachims s SVM-light kit which contains two. Exe files svm_classify.exe svm_learn.exe can Transductive SVM with Anton
iecWP-internetofthings-LR-en
- Spatial index trees constructed in wireless sensor networks are used to determine the sensors which can participate the query accurately and quickly.
minimum-spanning-tree_Kruskal
- 一个C++实现的最小生成树,使用的是Kruskal(克鲁斯卡尔)算法.-C++ achieve a minimum spanning tree, using the Kruskal (Kruskal) algorithm.
beibaosuanfa
- 背包问题的贪心算法程序源代码下载C++。-Knapsack problem greedy algorithm source code download C++.
ex4_division
- 形状分割，采用指标为短轴与长轴之比，骨架复杂度。效果很好，预处理合理-Shape segmentation, the use of indicators for the short axis and long axis ratio, frame complexity. Good effect, pre-rational
ganzhiqi
- 模式识别中的感知器算法，属于人工智能的其中一个简单的表达-Perceptron in pattern recognition algorithms, artificial intelligence, which is a simple expression
TSP
- TSP算法在VC环境中的另类实现，利用了MFC STL 等技术-implementation of TSP algorithm in VC environment
Maze
- 基于栈和队列的迷宫程序 实现自动生成迷宫，一步一步演示迷宫解法的功能-Stack and queue based on automatically generated maze maze procedure, step by step demo features a maze solution
mytfr
- 这是人工智能不确定性推理中贝叶斯方法的程序，是用VC++做的。由于是学生实验，所以比较简单。-It is the uncertain reasoning in artificial intelligence--Bayesian approach procedure 。I s done with VC++. As is the student experiment, it is more simple.
KrusklaPrim
- 最小生成树 Kruskal和Prim的比较 可以根据用户输入的点数和边数随机生成图并且保证是连通图-Kruskal and Prim' s minimum spanning tree can compare the number of points based on user input and the edges are randomly generated map and ensuring that connected graph