-
matlab_GCP
用matlabf编程求解通常的图着色问题,经常使用这个原理的.(Matlabf programming is usually used to solve the graph coloring problem, frequent use of this principle.)
- 2007-09-20 19:36:18下载
- 积分：1
-
rls_nlms
Algoritmo de rls en matlab, archivo .m
- 2010-07-12 06:46:22下载
- 积分：1
-
zuixiaowaiqiejvxing
最小外接矩形，基于最小外切矩形方法来计算目标区域的长宽(Minimum bounding rectangle)
- 2014-08-15 19:44:52下载
- 积分：1
-
1
说明： 模式识别、窗函数法高斯分布、近邻法高斯分布、Fisher线性变换(Pattern Recognition, Gaussian window function, nearest neighbor Gaussian distribution, Fisher linear transformation)
- 2010-06-23 09:52:38下载
- 积分：1
-
Digital_Signal_Processing_Using_Matlab
ebook about Digital Signal Processing Using Matlab
- 2009-03-05 17:51:29下载
- 积分：1
-
kmean
k均值归类方法 可用于训练初始的混合高斯参数(k mean cluster for initialization of GMM)
- 2010-08-24 16:50:34下载
- 积分：1
-
baotong
一个报童从报刊发行中心订报后零售，每卖一份报纸可赚钱a元；若报纸卖不出去，则退回发行处，每退一份要赔钱b元。每天报童卖出的份数是随机的，但报童可以根据以往卖报情况统计得到每天卖k份报纸的概率密度p(k)。
（1） 求报童每天期望收益达到最大（或损失达到最小）的定报量z。
（2） 改变参数a/b的值，观察订报量的最优值变化，画出变化曲线。
试画出仿真流程图，进行程序实现，并对仿真结果进行分析。
(A newsboy subscribe from the press after the retail distribution centers, each sale of a newspaper can make money a million if newspapers can not be sold, then returned to Issue Department, each retire to a loss of a b element. Newsboy sold shares in a day is random, but the newsboy can sell based on past statistics reported to be selling daily newspaper k the probability density p (k). (1) seeking newsboy expected profit per day to maximize (or minimize loss) reported that the volume of fixed-z. (2) change the parameters a/b values, subscribe to observe changes in the volume of the optimal value, draw curve. Simulation test to draw a flow chart for program realization, and simulation results for analysis.)
- 2008-06-14 01:16:47下载
- 积分：1
-
Lin_Wein_Fil
linear wiener filter
- 2012-04-08 18:08:26下载
- 积分：1
-
lvq
neural network, LVQ , matlab code
- 2011-08-20 10:33:09下载
- 积分：1
-
matlab-tongjifenxi
《matlab统计分析与应用：40个案例分析》一书的全部代码(Matlab statistical analysis and application: 40 case studies of a book all the code)
- 2012-08-16 11:44:06下载
- 积分：1
