-
the-shortest-route
使用matlab编程,图论最短路线的Ford迭代算法、Dijkstra算法和Floyd算法(Ford shortest graph theory iterative algorithm)
- 2013-07-21 22:54:09下载
- 积分:1
-
Radar-Simulation-Instructions
radar matlab simulation
- 2011-10-01 14:11:47下载
- 积分:1
-
RF-matlab-tools
射频电路中各组件模拟,包括放大器、环形器、转接头、测试单元、smith源等(tools in radio frequency circuit, including amplifiers circles
conversion networks smith.)
- 2013-05-14 21:45:10下载
- 积分:1
-
ACMsnakes
This program proveides a solution by Ghassan Hamarneh for detection curves using ACTIVE CONTOUR MODELS
- 2009-04-02 19:30:32下载
- 积分:1
-
PotentialField
Potential Field Function
- 2011-11-30 02:27:39下载
- 积分:1
-
pushangfa
基于谱熵法的语音信号端点检测方法的matlab程序,可以用于语音信号的处理(Endpoint detection method based on speech signal spectrum entropy method matlab program that can be used to handle voice signals)
- 2015-01-13 17:04:52下载
- 积分:1
-
yizhongsuijiduotuoyuanjiancedekuaisusuanfa
针对多椭圆检测问题提出了一种快速随机检测算法。该算法利用在图像中随机采样到的一个边缘点和
局部搜索到的两个边缘点以及这三个点的邻域信息确定候选椭圆,再将候选椭圆变换为对应圆,通过确认真圆来确
认真椭圆。在确定候选椭圆时,最大限度地减少随机采样点数 剔除更多的非椭圆点,降低了无效采样,减少了无效
计算。数值实验结果表明:该算法具有良好的鲁棒性,其检测速度比同类算法快(Ellipse detection problem for many a fast random detection algorithm. The algorithm uses random sampling in the image of an edge point and the local search to the two edge points, as well as the three-point neighborhood information to determine the candidate ellipse, and then transformed into the corresponding elliptical candidate won, through the identification of real yen to confirm really elliptical. In determining when a candidate ellipse, to minimize random sampling points ‰ remove more non-oval points, reducing invalid sampling, to reduce the calculation invalid. Numerical experimental results show that: the algorithm has good robustness, and its detection faster than similar algorithms quickly)
- 2009-03-21 19:12:42下载
- 积分:1
-
2dFDTD
利用时域有限差分方法模拟光子晶体光纤的算法程序(The use of finite-difference time-domain simulation of photonic crystal fiber algorithm procedure)
- 2009-05-14 13:48:28下载
- 积分:1
-
ltsa
LTSA[19] is based on the intuition that when a manifold is correctly unfolded, all of the tangent hyperplanes to the manifold will become aligned. It begins by computing the k-nearest neighbors of every point. It computes the tangent space at every point by computing the d-first principal components in each local neighborhood. It then optimizes to find an embedding that aligns the tangent spaces.
- 2011-01-23 02:19:08下载
- 积分:1
-
NSGA-II
NSGAII,多目标优化领域,非控制遗传算法(NSGAII, the field of multi-objective optimization, non-control genetic algorithm)
- 2012-05-28 22:03:02下载
- 积分:1