-
HMM2
隐马尔科夫模型的ppt课件，比较通俗易懂(Hidden Markov model ppt courseware, more user-friendly)
- 2010-12-20 12:17:55下载
- 积分：1
-
图像的复原
对图像进行滤波、加噪，对图像进行模糊、复原处理，另有点扩散函数与光学转换函数间的互化。(The image is filtered and noisy, the image is blurred and restored, and the point diffusion function is interchanged with the optical conversion function.)
- 2017-12-05 15:03:08下载
- 积分：1
-
05487103
fundamentals of cbir system...
- 2010-09-28 22:10:27下载
- 积分：1
-
gawnn
说明： 非常实用的小波网络与遗传算法结合源程序,很简练(A source code of GA wavelet neural network )
- 2010-04-15 16:36:57下载
- 积分：1
-
xinyi
说明： ·Matlab加扰解扰仿真系统，可以观察加解扰前后信号的时域和频域波形，有助于理解扰码的概念和解扰的过程(scrambling and de-scrambling Matlab simulation system Encryption can be observed around the signals in time domain and frequency domain waveforms scrambler help understand the concept of the process and Descramble)
- 2006-05-14 16:42:57下载
- 积分：1
-
selectivemapping_papr
This is matlab simulation of selective mapping technique for papr reduction.Sequences that are independent and represent the same information are generated.PAPR of these are calculated separately. Sequence with the smallest PAPR is selected for final serial transmission
- 2013-11-08 19:54:19下载
- 积分：1
-
roots-by-gauss-siedel
this code helps to find roota of equation by gauss seidel method
- 2014-12-24 02:06:45下载
- 积分：1
-
PSO501
优化问题是工业设计中经常遇到的问题,许多问题最后都可以归结为优化问题. 为了解决各种各样的优化问题,人们提出了许多优化算法,比较著名的有爬山法、遗传算法神经网络算法等.
(Optimization problem is often encountered in industrial design, many problems can be attributed to the last optimization problem in order to solve a variety of optimization problems, many optimization algorithms have been proposed, relatively well-known climbing method, genetic algorithm neural network algorithm.)
- 2014-02-08 09:06:04下载
- 积分：1
-
Polyroots
Find roots of a polynomial with very high degree and multiplicity by this compact routine.
- 2010-12-14 13:05:05下载
- 积分：1
-
code
说明： 使用matlab实现支持向量机模型 的二分类 使用cvx的工具箱(Using MATLAB to realize the second classification of SVM model using CVX toolbox)
- 2021-03-24 21:59:35下载
- 积分：1
|
联系客服（QQ：3324461878）
