资源列表
Mesh
- 摘要：针对传统的DP算法存在条纹瑕疵，提出了一种改进的垂直性约束动态规划立体匹配算法，通过利用扫描线间的相关信息来约束动态规划过程，使得处理每一条扫描线时都能充分利用以前扫描线的匹配信息。实验结果表明，该算法可以明显地消除传统DP算法的视差图的条纹瑕疵，匹配精度高, 而且执行时间短。-ABSTRACT Although network speed has been increased over the years,bandwidth limitation continues to pos
Arithmetic_Coding
- 算数码C++编程，实现算数码的编码过程。输入字符串，算法实现该字符串的数字编码过程。-Arithmetic_Coding，C++ Programming
AVLTree
- 使用vc++6.0，实现平衡二叉树的操作演示，功能包括创建、查找、插入、删除、合并和分裂平衡二叉树。内附详细说明文档-Use vc++6.0, balanced binary tree operation and demonstration functions include creating, search, insert, delete, merge and split balanced binary tree. Included detailed documentation
sort
- 自己写的排序程序，冒泡法和快速排序法，vs2008，控制台-Write your own sorting program, bubbling, and the quick sort, vs2008, console
Hash
- 本例是用C语言编写的HashMap相关操作的源码，其中包含了原理介绍及其他操作，4个工程，非常值得下载学习。VS2008直接可以打开运行。-This case is HashMap operation using the C language source code, which contains a principle introduced and other operations, and four of the project, well worth the download learni
bellman-ford
- bellman-ford的实现。可以输出每条最短路径经过的节点-bellman-ford implementation. After the shortest path to the output node of each
1
- 本算法用来产生0~100之间的随机数，随机数的可靠性强，经过严格离散处理，不会像一般的随机数发生器那样。-The algorithm used to generate a random number between 0~100
data(word)
- 数据结构比较全的题目,有利于面试笔试,是你学习的好东西-Comparison of the whole data structure of the title, the interview written in favor of
beibao
- 背包问题的资料，相对比较全了，可以入门学习用。-Knapsack problem of information, relatively wide, and can be started learning to use.
houzi
- 猴子摘香蕉问题使用C++语言描述，写的不好请大家多提意见！-Monkey mialaw problems using C++ language descr iption, is badly written please speak up!
databaseOrganizationTeachingMaterials
- 数据结构对新学者来说比较复杂。这是一个介绍数据结构的讲义，可以帮助新手快速了解数据结构，有感性认识-Data structure for the new academic complex. This is a data structure of the notes, introduced to help novices understand the data structure fast, there are perceptual knowledge
data1800
- 数据结构练习测试-Data Structures Practice Test