网站首页

sg_demo01

于 2014-10-18 发布文件大小:1KB

 0  73

下载积分: 1 下载次数: 1

我要下载

代码说明：

MATLAB PROGRAM FOR RECOGNICTION

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

Cdma2000matlab
Cdma2000实现代码的matlab程序(Cdma2000 procedures to achieve code matlab)

2007-12-23 19:30:58下载

积分：1
ClusterEnsembleV20
聚类集成算法CSPA、HGPA、MCLA的实现(three cluster ensembles algorithms cspa，hgpa and mcla)

2012-04-23 19:41:33下载

积分：1
matlab_ipt_tutorial
ce turorial presente le finctionnement du matlab 6.5

2013-02-04 19:24:49下载

积分：1
minBFGS
求极小值，最优化方法的一个matlab范例(Seek the minimum value, a Matlab example of optimization methods)

2012-05-31 20:41:31下载

积分：1
Clustering_Coefficient
生物中关于复杂网络拓扑性分析中的聚类系数，使用MATLAB对矩阵进行计算(Creatures of complex network topology analysis, the clustering coefficient, using MATLAB to matrix to calculate)

2014-04-21 16:17:28下载

积分：1
ACATSP
说明： A standard ant colony algorithm coded to address the TSP.

2019-01-04 09:25:10下载

积分：1
lsm-rbf
说明：一种最小二乘法的RBF网络 ---------------------------------- radical basis function neural network ------------------------------------------ clear all close all global sp k w2 b2 unitcenters alldatanum=400 traindatanum=300 testdatanum=100 sp=8 errorlimit=0.1 u=rand(1,alldatanum+10) y=zeros(1,alldatanum+10) for i=4:alldatanum+3 y(1,i)=1.5*y(1,i-1)*y(1,i-2)*y(1,i-3)/(3+y(1,i-1)+y(1,i-2)*y(1,i-2)+... y(1,i-3)*y(1,i-3)*y(1,i-3))+u(1,i)+u(1,i-1)+u(1,i-2) 。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。(radical basis function neural network ------------------------------------------ clear all close all global sp k w2 b2 unitcenters alldatanum=400 traindatanum=300 testdatanum=100 sp=8 errorlimit=0.1 u=rand(1,alldatanum+10) y=zeros(1,alldatanum+10) for i=4:alldatanum+3 y(1,i)=1.5*y(1,i-1)*y(1,i-2)*y(1,i-3)/(3+y(1,i-1)+y(1,i-2)*y(1,i-2)+... y(1,i-3)*y(1,i-3)*y(1,i-3))+u(1,i)+u(1,i-1)+u(1,i-2) 。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。)

2011-04-13 10:26:06下载

积分：1
tsp-matlab
The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.

2013-10-22 00:42:51下载

积分：1
ObjectFunctionComparisonRejection
multi - objective optimisation

2012-11-23 19:38:16下载

积分：1
gabormask
Gabor-function convolution masks are increasingly used in image processing and computer vision. This function simply computes the cosine and sine masks for a given width, period and orientation. The masks returned are properly normalised. It is not highly optimised - e.g. the symmetries are not used to reduce the computation. It is recommended that convolutions with these masks are done using CONVOLVE2 (available from Matlab File Exchange) to take advantage of their low rank. (Gabor-function convolution masks are increasingly used in image processing and computer vision. This function simply computes the cosine and sine masks for a given width, period and orientation. The masks returned are properly normalised. It is not highly optimised- e.g. the symmetries are not used to reduce the computation. It is recommended that convolutions with these masks are done using CONVOLVE2 (available from Matlab File Exchange) to take advantage of their low rank. )

2007-11-27 10:05:47下载

积分：1

696518资源总数
104269会员总数
42今日下载

sg_demo01

0 个回复

热门标签

热门下载