资源列表
C1PROJ2001-1
- 影像中角落的偵測-主要是機器視覺當中很重要的一環 因為角落的改變或是變化可以偵測出來當做影像變化的特徵-corner of the image detection-key machine vision which is very important because one corner of the ring or change can be detected changes as changes in the imaging characteristics
哈夫曼编码原码
- 用C语言实现哈夫曼编码对文件进行压缩,并没有通过类来实现,只是用标准的C语言中结构实现的,代码内部说明比较详细,具体可以看代码,包括对文件的编码也解码.-C language of the document Huffman coding compression, and not through the categories to fruition, but the standard C language structure to achieve, and the internal code no
wrar35b5sc
- 压缩和解压文件，是一个好的解压缩工具，还是一个比较好的系统工具。-It s a good tool for compression and decompression,besides it s also a good system tool!
一维搜索算法
- 本算法为机械优化设计中的一维黄金搜索算法，可以求取方程的极值。-This programm realizes the golden section search method for machanical one-dimesion optimum designing ,you can use it to get the mimimax solution
exlp
- 一个小型计算器，可以进行/加/减/乘/除/开放运算，希望你们喜欢。-a small calculator, can / add / subtract / multiply / addition / open computing, I hope you like.
简单易懂的CRC
- 这是一个简单易懂的crc计算方法，选择你要计算的文件，准确计算crc值。-This is a simple and easy to unicef.org calculation method to calculate your choice of paper, accurate calculation unicef.org value.
Link_list
- 用链表实现多项式的加法与乘法，链表是采用数据结构里面的单链表-polynomial with the addition and multiplication, linked list data structure is used inside the single-linked list
9连环
- 这是关于古代9连环问题的求解过程，包括安装跟坼卸-This is a chain of nine ancient problem solving process, including the installation of crack with dumping
荒岛野人
- 这个是关于荒岛野人的算法实现，有什么问题请留言-the savage wasteland of the algorithm to achieve and what problems they please leave
ercheng
- 最小二乘法曲线拟合的经典算法，做过特征数检验，只需调用fit，文件中其他函数被fit调用，其中个输入输出变量均以给出详细说明。-least squares curve fitting classic algorithms, the number of tests done, just call fit, the paper other function to be fit Call, 000 input and output variables were presented in detail.
LBC
- (31,21) bch 码编解码程序 C++实现.-(31,21) BCH encoding and decoding procedures C achieve.
primenumber.
- 一个求素数个数的程序 算pi(1000000000)不要1秒每个块如果10 0000, 需要 < 100000次全搜索加上8000 * 8000 < 6400 0000 总的次数小于7000 0000,就是说,搜索次数大大降低-for a few number-counting procedures pi (1000000000) not a second of each block of 10 0000, the need lt; Search 100,000 plenary wi