This is the DWT and IDWT source. Discrete wavelet of the original program.

数组堆栈与链表堆栈的实现代码-array stack and the realization Chain stack code

安全工具包 2006年10月15日更新 请看帮助说明-security tool kit on October 15, 2006 to help update See Note

C语言内嵌汇编实例-embedded C language compilation examples

Pacman 玩家控制一个东西把所有钻吃掉 不能动到鬼 也可吃特殊的东西把鬼吃掉-Pacman players control a thing to eat all the drilling should not move to the ghost can also eat special things to eat ghosts

LM1875芯片资料。有需要的朋友请下载-LM1875 chip information. Friend in need, please download

能放大部分屏幕可以用来擦看一些很小的字或图片上的细节-Can enlarge part of the screen can be used to rub a small word or a look at some details of the pictures

人脸识别相关的英文论文,希望对你有帮助-Face Recognition related English papers, I hope you have help

矩阵的奇异值分解，ap为是矩阵a，up返回左奇异值，vp返回右奇异值-Matrix singular value decomposition, ap is the matrix for a, up to return the left singular value, vp return the right singular value

分水岭算法的演示程序 分水岭算法的演示程序 -watershed algorithm Demonstration Program watershed algorithm Demonstration Program

/*本人先后编了两次，第二次进行了改进。改进的思想主要是注意到棋盘上每一点的下一可到达点的个数 （下称为权值）不同，对于可到达点较少（权值小）的点应该先跳上去，这样后来跳的点可跳的方向就比 较多，回溯的现象就比较少，这样就可以大幅度提高速度*/-/* I have compiled twice, the second time for improvements. Improved thinking is that every point on the chessboard of the next point can be reached by the number (hereinafter referred to as the right value), For less accessible spots (small weights) should be the first point and jumped out of the way and then jump to the point of jumping on the direction of more, Looking back on the phenomenon of relatively small, we can significantly improve the speed* /