资源列表
ShuXueJianMo2008
- 这是我们组参加2008年全国大学生数学建模时A题(数码相机定位)所用到得程序，我们最终获得了全国一等奖的好成绩哦！-This is our group in 2008, when the national college mathematical modeling A digital camera positioning problem (use), we finally have program won the national first good result!
Normalized_LMS
- LMS 神经网络算法，一种经典的高效程序-LMS neural network algorithm, a classic high-performance process
reed-solomon-4.0.tar
- This package implements a general purpose Reed-Solomon encoding and decoding facility. See the rs.3 man page for details.
genetic-algorithm-artificial-life-simulation
- 基于遗传算法的人工生命模拟,用VC++编写，对于理解遗传算法有好处-Based on genetic algorithm artificial life simulation, using VC++ to prepare, good for understanding the genetic algorithm
Harriscornerdetection
- Harris Corner detection algorithm
Bubblesort
- 冒泡法排序是在一组数据中依次比较相邻的两个元素，如果相邻的两个元素是逆序，改变其顺序，循环若干遍，直到数据是从小到大的排序。-Bubble sort method are at a group of data followed by comparison of the two adjacent elements, if two adjacent elements are in reverse, to change its order, the cycle several times until
asp.net
- 视频采集器,可以采集网站上素有视频网址，只能分析 内容与标题！-Video Capture, you can always capture video on web site, only analysis of the content and the title!
choosesort
- 选择法排序是从数据中选择最小的同第一个值交换，再从剩下的部分中选择最小的与第二个值交换，这样循环下去，直到循环结束。-Selection method to sort the data selection from the smallest value with the first exchange, and then the remaining part from the selection with the second smallest value of the exchange, so
speedsort
- 快速排序是选一个中间值，程序中使用中间值，然后把比它小的数据放在左边，大的数据放在右边。两边分别递归这个过程。-Quick Sort is the election of a middle value between the value of the use of the procedure, and then put it smaller than the data on the left, the data on the right side. Recursive separately on
changesort
- 交换法比较简单，在一组数据中每次用当前的元素同后面的元素比较并在符合条件时交换。直到该组数据是从小到大的序列-Exchange method is relatively simple, in one set of data in each element with the current elements in comparison with the back and in line with the conditions of the exchange. Until the data are
insertsort
- 插入法的基本工作原理是抽出一个数据，在前面的数据中寻找相应的位置插入，然后继续下一个数据，直到完成排序。-Insert the basic working principle of a data are drawn, in front of the data looking for the location of the corresponding insert, and then continue to the next data until the completion of sequenc