资源列表
juisei
- Gabor小波变换与PCA的人脸识别代码，模拟数据分析处理的过程，最大似然（ML）准则和最大后验概率（MAP）准则。- Gabor wavelet transform and PCA face recognition code, Analog data analysis processing, Maximum Likelihood (ML) criteria and maximum a posteriori (MAP) criterion.
kangpao
- 实现了对10个数字音的识别，连续相位调制信号(CPM)产生，计算十字叉丝的在不同距离的衍射图像。- To achieve the recognition of 10 digital sound, Continuous phase modulation signal (CPM) to produce, Calculation crosshairs diffraction image at different distances.
kaonie_v85
- 结合PCA的尺度不变特征变换(SIFT)算法，Gabor小波变换与PCA的人脸识别代码，实现了图像的灰度化并进一步用于视频监视控。- Combined with PCA scale invariant feature transform (SIFT) algorithm, Gabor wavelet transform and PCA face recognition code, Achieve a grayscale image and further control for video su
DOF_Markov
- 一个 markov jump system仿真程序-h2 and h-inf control of markov jump system
switchingsystem
- 这是一个切换系统matlab仿真程序，其中含数值例子-The code is implemented according to Algorithm 1 that appeared in: C.-J. Ong, Z. Wang, and M. Dehghan, Model Predictive Control for Switching System with Dwell-time Restriction ,
zuixiaoerchengST
- 这是一个通用的最小二乘状态估计算法，做毕设论文用过，好用-This is a general state of least squares estimation algorithms, and so Albert located paper used, easy to use
SKoh
- 该代码为基于有导师监督的Kohonen网络的分类算法-The code is based on the supervision of the instructors Kohonen network classification algorithm
Koh
- 该代码为基于Kohonen网络的分类算法-The code is based on Kohonen network classification algorithm
chapterBP
- 神经网络变量筛选—基于BP的神经网络变量筛选-Neural network variable selection- BP neural network variables based screening
FuzzyNet
- 该代码为基于模糊神经网络的水质评价优劣的代码-The code is based on water quality assessment of the merits of fuzzy neural network code
01packageProblem
- 经典的0-1背包算法，采用动态规划法。n个重量不同，价值不等的物品，放入一个承重量固定的背包中，单个物品不能拆分，求最大价值的组合。- Classic 0-1 knapsack algorithm, using dynamic programming method. N weight is different, the value of items, into a fixed weight of the backpack, a single item can not be split,
Dijkstra
- 经典的Dijkstra算法，采用贪婪技术，考虑单起点最短路径问题：对于加权连通图的一个称为起点的给定节点，求出它到所有其他顶点之间的一系列最短路径。- The classical Dijkstra algorithm, the greedy technique, consider single source shortest path problem: for weighted connected graph of a known as the starting point of a