-
Mersenne-Twister-suijishufashengqi
Mersenne Twister随机数发生器(Mersenne Twister generator,MTG for short)是Makoto Matsumoto于1998年对TGFSRG(旋转广义反馈移位寄存器发生器)的更进一步改进。(Mersenne Twister random number generator (Mersenne Twister generator, MTG for short) is Makoto Matsumoto in 1998 TGFSRG (rotation generalized feedback shift register generator) is further improved.)
- 2011-06-29 19:48:15下载
- 积分:1
-
gui
说明: 一个简单matlab gui编程的例子 进行边缘检测(a sample example program bt matlab gui,
Find edges in a picture)
- 2009-08-25 20:16:16下载
- 积分:1
-
csp
脑电信号模式识别(EEG pattern recognition)
- 2019-01-03 10:22:45下载
- 积分:1
-
histeq
说明: 用非matlab工具箱实现直方图均衡化。(With non-realization of histogram equalization matlab toolbox.)
- 2010-03-30 22:34:01下载
- 积分:1
-
matlab_networks
网络的参数,复杂网络的工具箱,可以计算节点的度,网络的性质,中心度等等(Network parameters, complex network toolbox, you can calculate the degree of a node, the nature of the network, centrality, etc.)
- 2014-02-09 02:31:32下载
- 积分:1
-
LEACH_m
low energy adaptive clustering code in matlab for wireless sensor netwoks
- 2010-06-08 14:52:40下载
- 积分:1
-
desc
最速下降法 求极小值问题的程序示例 其中包含三个函数(Steepest descent procedure for seeking the minimum value problem examples)
- 2009-11-06 12:33:13下载
- 积分:1
-
dip2
说明: 基于信息融合的图像边缘检测方法研究,⑴直方图均衡化(histogram equalization),⑵直方图匹配(histogram matching),⑶邻域平均(neighborhood averaging),⑷局域增强(local enhancement), ⑸中值滤波(median filtering)。(Edge detection method, 1 histogram equalization (histogram equalization). 2 histogram matching (histogram matching). 3 Neighborhood average (neighborhood averaging) 4 Local Enhancement (local enhancement). together median filter (median filtering).)
- 2006-05-14 17:16:31下载
- 积分:1
-
Basics-Of-MATLAB-And-Beyond
Basic of MATLAB and beyond
- 2013-10-25 22:16:13下载
- 积分:1
-
Floyd
Floyd算法的matlab实现。对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵,且能查询任意两点间的最短距离和路由。并根据结果自动绘制出了最短路径图。
程序中使用了前向路由和回溯路由两种方法,并对于无向图进一步减小算法复杂度。(Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figure, the shortest distance matrix and routing matrix, and can query the shortest distance between any two points and routing. Automatically based on the results map out the shortest path graph. Used in the program prior to routing and backward routing are two methods, and undirected graph further reduce the algorithm complexity.)
- 2012-07-23 10:28:52下载
- 积分:1