-
SVM
有关SVM的浓缩讲稿，内容讲解很详细，是
SVM初学者的良师益友(Enrichment lectures about SVM, content to explain in great detail, SVM mentor for beginners)
- 2012-10-01 16:52:07下载
- 积分：1
-
WATERMARKING
WATERMARKING M-file for WATERMARKING.fig
- 2011-12-30 01:05:33下载
- 积分：1
-
FCM
基于matlab写的HCM和FCM程序，以及快速算法KFCM算法，对写毕业设计的很有用(Based on matlab HCM and FCM written procedures and fast algorithm for writing, KFCM algorithm of graduation design is very useful)
- 2010-06-04 13:48:11下载
- 积分：1
-
thermal-3
thermal conductivity :Code for Temperature dependent of cross plane
(thermal conductivity :Code for Temperature dependent of cross plane )
- 2011-02-07 11:32:36下载
- 积分：1
-
BPaRBF
利用BP神经网络与RBF（径向基函数）网络对三类目标（W.zip, T.zip, B.zip）进行分类.(BP neural network and RBF (Radial Basis Function) network on three targets (W.zip, T.zip, B.zip) classification.)
- 2015-03-26 19:14:56下载
- 积分：1
-
communication-system-simulation
通信系统仿真远理与无线应用（作者willian H.tranter） 书内所用例题的Matlab代码(communication system simulation with wirless applications)
- 2014-02-21 18:38:45下载
- 积分：1
-
watermarking_extraction
彩色水印提取算法，含说明，希望对大家有用(Color watermark extraction algorithm, with that, we hope to be useful)
- 2010-12-29 16:17:27下载
- 积分：1
-
MATLAB6.x_Symbolic_Calculation_and_Applications
说明： 《Matlab6.x符号计算与应用》机械工业出版社2003年版，刘宏友 彭锋 等编著。本书基于matlab6.0环境下的大量实例，介绍了matlab符号计算功能的适用方法。(Matlab6.x symbolic computation and application，China Machine Press, 2003 edition. LIU Hongyou-Peng Feng, eds. This book based on a large number of instances in matlab6.0 environment, introduced the application of matlab symbolic computing methods.)
- 2010-04-19 16:12:19下载
- 积分：1
-
xiaobo
这个是关于小波变换，对图像增强介绍的文章，共大家参考研究、使用。(This is the wavelet transform, image enhancement described in the article on the total of your reference and use.)
- 2010-05-18 16:41:37下载
- 积分：1
-
SIMULATED-ANNEALING-
这是一个关于商人visit许多城市，怎样走法才能使距离最短的例子，采样的了退火算法的经典案例(Traveling Salesman Problem (TSP) has been an interesting problem for a l
me in classical optimization techniques which are based on linear and nonlin
ogramming. TSP can be described as follows: Given a numberof cities to v
d their distances from all other cities know, an optimal travel route has to
und so that each city is visited one and only once with the least possible dista
aveled. This is a simple problem with handful of cities but becomes complica
the number increases.)
- 2013-12-15 03:26:30下载
- 积分：1
