-
MATLAB
精通matlab程序，包括遗传算法以及粒子群优化算法程序(Proficient in matlab procedures, including genetic algorithm and particle swarm optimization algorithm program)
- 2013-01-09 16:05:58下载
- 积分：1
-
Mathematica-Sudoku
用mathematica编写的数独解答小程序。用Mathematica7编写，主要分为图形绘制和数独解答两个部分。实现的功能是：可自行设计、输入数独，程序将快速得出正确答案。(Sudoku answer small program written using Mathematica. Written in Mathematica 7, mainly divided into two parts graphics rendering Sudoku answer. Achieve the function is: can design their own input Sudoku, the program will quickly arrive at the correct answer.)
- 2013-04-26 20:11:23下载
- 积分：1
-
wavelet
小波变换及编码在图像图形处理中有着重要的应用，本压缩包属于小波编码及其演示的matlab库函数，希望对大家的学习有帮助。(Wavelet transform and image coding has important applications in graphics processing, the wavelet encoding and compression packages are demo matlab library function, we hope to help learning.)
- 2014-02-21 09:09:40下载
- 积分：1
-
two_tone
matlab two tone generation
- 2009-07-17 17:25:54下载
- 积分：1
-
32qam_awgn
说明： 32qam调制在AWGN信道中的符号误码率(32qam modulation symbols in the AWGN channel BER)
- 2008-09-12 15:47:06下载
- 积分：1
-
matlab7.1
FIR数字滤波器频率采样法设计（基于matlab的软件设计）(FIR digital filter frequency sampling design (based on the Matlab software design))
- 2007-05-09 17:15:51下载
- 积分：1
-
huidutu
在matlab中，绘制图像的灰度直方图，并均衡化复原图像(In matlab, rendering the image histogram, and equalization restored image)
- 2013-08-22 17:10:11下载
- 积分：1
-
Plscmd
partial least square matlab code.
- 2009-04-01 06:15:39下载
- 积分：1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分：1
-
Independent-component-analysis
演示代码为“独立分量分析:教程介绍”版权:2005年,企业石、心理学系、谢菲尔德大学,谢菲尔德,英格兰。(Demonstration code for "Independent component analysis: A Tutorial Introduction")
- 2013-12-05 15:44:51下载
- 积分：1
