资源列表
CannyDemo
- 自己写的Canny算子的matlab实现和演示。程序虽然不大，但相信也能给大家一些参考。 -himself wrote the Canny Operator Matlab realization and demonstration. Procedures not much, but I believe that can give you some information.
ZTrans_InvTrans
- 对输入的一有理Z变换表达式（输入分子和分母系数序列），分别画出： （1）零极点图 （2）z在单位圆上时z变换所对应的DTFT的幅度谱和相位谱 （3）逆z变换所得序列，在各种不同的收敛域下（包括了右边序列，左边序列和双边序列的情况） -the importation of a rational expression Z-transform (input coefficient of the numerator and the denominator sequence), respe
AdaptiveHuffman
- 自适应huffman编码，即在编/解码过程中根据已编/解码数据来计算各个码字的概率，并动态调整huffman树。包括编码器和解码器。 在vc++.net 2003下开发-adaptive Huffman coding, that is the encoding / decoding process based encoding / decoding data to calculate various code word probability, Dynamic adjustment and
adaptive_arithmetic
- 自适应算术编码的实现，包括编码器和解码器。在vc++.net 2003下开发。-adaptive arithmetic coding implementation, including the encoder and decoder. In vc. Net 2003 under development.
canvas
- 用双向链表寻找迷宫路径，可以自己记住路径并实时删除舍弃路径-used for two-way maze trails can remember their own path and immediately delete abandon path
qpsk_ber
- 通信系统的仿真,在现在的毕业设计和课程设计中都有要求的-communications system simulation, the current graduation design and curriculum design, have requested the
card24
- 可以进行分数的24点运算的，因为里面还额外实现了一个分数类。24点必须用VC编译，GCC编译会有问题，这个bug当时没找出来。可能是默认堆栈大小的问题。这个程序从我现在看来，写得很差。-can score 24 points in computing, because it has achieved an additional category scores. 24 points to be compiled with VC, the GCC compiler will create probl
ccccccccctc
- n牛的c语言经典例题，学好c语言在此一举-n cattle classic example c language, learn the language c one stroke
XorNN
- 编了一个用C++程序实现BP网络的异或问题。-compiled a C program BP network problems or differences.
Expert_Choice[1]
- Expert Choice represents a significant contribution to the decision making process 工t assists a decision maker in solving complex problems involving many criteria and several courses of action . An Expert Choice solution to a problem reflects the exp
samp
- 自适应控制的例程 文件samp.m使用matlab6.5通过-adaptive control routines samp.m documents through the use of matlab6.5
GREEDYSELECT1
- 这是一个会议安排问题,知道没个会议的开此时间跟结束时间就可以求要求的最少会议室 理论基础是谈心算法-This is an organization of the session, know that the meetings did not set a time to the end of time can be the minimum requirement in order Conference Room theoretical basis of the algorithm for he