-
Bayes2
基本的贝叶斯算法(朴素贝叶斯算法,参照清华大学出版的模式识别)(The basic Bayesian algorithm (Naive Bayes algorithm, in the light of pattern recognition, Tsinghua University Publishing))
- 2010-10-27 20:23:58下载
- 积分:1
-
total_improved_leach
这个是leach算法的优化版本,对学习WSN有好处,而且是我毕业设计的课题。(This is the improved Leach protocol,which is quit usful in learning WSNs.)
- 2011-04-23 16:18:27下载
- 积分:1
-
logread
LTSPACE的信号log文件读取 LTSPACE的信号log文件读取(LTSPACE signal read LTSPACE log file log file to read the signals)
- 2011-09-09 13:51:22下载
- 积分:1
-
SteepestDescent
最速下降法又称为梯度法,是1847 年由著名数学家Cauchy 给出的,它是解析法中最古老的一种,其他解析方法或是它的变形,或是受它的启发而得到的,因此它是最优化方法的基础。这里给出其Matlab源程序。(The steepest descent method, also known as gradient method, was in 1847 given by the famous mathematician Cauchy, it is the oldest analytical method one, other analytical method or its variants, or inspired by it obtained and therefore it is the basis for the optimization method. Here are its Matlab source.)
- 2013-09-13 11:56:03下载
- 积分:1
-
BP
说明: bp神经网络实现预测,已经在鸢尾花数据集中验证过,拟合能力不错(Prediction of BP neural network)
- 2018-01-05 17:27:37下载
- 积分:1
-
bianyuan_lvbo_matlab
编写程序完成不同滤波器的图像频域降噪和边缘增强的算法并进行比较,得出结论,效果很好,多种方法工你选择,文档中包含图片(
Image Frequency noise reduction and edge enhancement algorithms to program completion and compare different filters, concluded that the effect is very good, work a variety of methods to choose from, the document contains a picture)
- 2016-09-19 21:13:08下载
- 积分:1
-
Spectr
简单的spectra分析程序,可以简单的画出结果图(Spectra analysis of simple procedures, you can simply draw the results of Figure)
- 2009-04-10 00:22:36下载
- 积分:1
-
dijikstra
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
- 2012-04-12 21:01:48下载
- 积分:1
-
Experiment 1- Introduction to MATLAB
BASIC MATLAB CODE FOR MATHMATICAL OPERATION
- 2020-06-24 03:20:01下载
- 积分:1
-
rinex
GPS rinex文件读取的MATLAB代码(source coed reading rinex data)
- 2010-07-28 14:13:54下载
- 积分:1