-
facereconition
提供了比较流行的人脸识别算法源代码，非常适合实验仿真(a very useful tool for face reconizer)
- 2010-10-21 21:21:12下载
- 积分：1
-
application-of-copula
copula函数的matlab应用，包括经验分布函数、核分布函数，参数的估计和检验。(Matlab application of Copula Functions, including the empirical distribution function, kernel distribution function, estimation and testing parameters.)
- 2015-02-25 15:07:30下载
- 积分：1
-
Forstner_szw
提取图像特征点，提取的效果较好，程序由matlab编写，简单易懂，可作为参考。(Extract image feature points extracted better, the program written by matlab, easy to understand, can be used as a reference.)
- 2014-04-09 20:15:54下载
- 积分：1
-
sar_echo
合成孔径雷达的点目标回波仿真MATLAB程序(Synthetic aperture radar target echo the point MATLAB simulation program)
- 2020-12-09 11:39:19下载
- 积分：1
-
dcpwm1
dc motor pwm control in matlab
- 2009-06-01 21:46:57下载
- 积分：1
-
path_discovery_main
AODV网络协议的matlab实现，运行主函数文件，输入始点和末点的序号，该程序会自动生成图显示基于AODV的从该始点到末点的路由(Matlab AODV network protocol implementations, run the main function of the file, enter the starting point and the end point of the serial number, the program will automatically generate AODV based on the start point to the end point of the route from the map display)
- 2021-01-06 23:38:52下载
- 积分：1
-
tianchongtuxiao
用于填冲图片中的空白域，设定一个种子点，然后从种子点开始填冲(Used to fill in the blank fields punch picture, set a seed point, and then rushed from the seeds begin to fill)
- 2013-10-20 19:29:41下载
- 积分：1
-
Matlab
Matlab命令大全，很全面地包涵了Matlab的命令，方面学习查询。(Matlab order Daquan, very comprehensive bear the Matlab command, in learning about the query.)
- 2013-11-10 22:49:37下载
- 积分：1
-
littleworld
NW小世界网络的构成原则为：从一个环状的规则网络开始，网络含有N个结点，每个结点向与它最近邻的K个结点连出K条边，并满足N>>K>>In(N)>>1。随后进行随机化加边，以概率p在随机选取的一对节点之间加上一条边。其中，任意两个不同的节点之间至多只能有一条边，并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时，NW小世界模型本质上等同于WS小世界模型。
(NW constitutive principles of small-world networks: from the rules of a ring network, network with N nodes, each node is connected to the K node with its nearest neighbor K edges, and meet N > > K > > In (N) > > 1. Followed by randomization into the plus side, with probability p with an edge between a pair of nodes in a randomly selected. Wherein between any two different nodes at most only one edge, and each node can not have a side connected with itself. P value can be changed to achieve the transition from the nearest neighbor coupling network (p = 0) coupled to the global network (p = 1). When p is small enough and large enough N, NW small-world model is essentially the same as the WS small-world model.)
- 2013-04-26 21:17:37下载
- 积分：1
-
Problems_in_Algorithmic_Algebra
Problems in Algorithmic Algebra
Math book
- 2010-06-09 09:21:29下载
- 积分：1
