-
IDASimulation
本文针对SLAM数据关联中使用最为广泛的最近邻方法作了改进，利用特征估计位置与载体预测位置之间的欧氏距离计算代替了全部特征与每个量测之间的马氏距离计算，避免了大量的矩阵乘法计算。该算法简单易行，降低了算法的计算复杂度，有利于SLAM算法的实时执行，且关联效果与全局最近邻法相同(In this paper, SLAM data association in the most widely used methods of improving the nearest neighbor, using the characteristics of the estimated location and the location of vector prediction Euclidean distance between the calculation instead of all the characteristics of each measurement between the Mahalanobis distance calculation, to avoid a large number of matrix multiplication calculation. The algorithm is simple, the algorithm to reduce computational complexity and is conducive to the implementation of real-time SLAM algorithm, and the effects associated with the same overall nearest neighbor method)
- 2008-12-19 11:09:48下载
- 积分：1
-
jsgd-61
该代码采用matlab和C混合编写，是采用随机梯度的方法训练线性分类器，它可用于数据、图像等的多类分类情况。参考论文：Good Practice in Large-Scale Learning for Image Classification(This a Stochastic Gradient Descent algorithm used to train linear multiclass classifiers. It is biased towards large classification problems (many classes, many examples, high dimensional data).)
- 2013-09-03 16:42:11下载
- 积分：1
-
9927416SHA_MatLab
hi its useful for matlab developers
- 2009-09-04 21:47:27下载
- 积分：1
-
KalmanFilter__matlab
Kalman滤波原理及源码matlab!适合初学的童鞋没，与大家一起分享(Kalman filter theory and source code matlab! Share with you)
- 2011-09-14 19:57:19下载
- 积分：1
-
555
matlab图像处理源代码 大家多多分享(matlab Image processing source code )
- 2009-05-26 18:01:58下载
- 积分：1
-
克里金插值
基本克里金算法，用于代理模型的参数计算，解决可靠性计算的通用matlab方法(Basic Kriging algorithm. The model is used to calculate the parameters of the agent model and to solve the general matlab method for reliability calculation)
- 2017-07-31 12:22:20下载
- 积分：1
-
prakiraan-beban-listrik-jawa-bali
Peramalan Beban Listrik Jawa Bali
- 2010-06-25 14:10:03下载
- 积分：1
-
FILter
利用模拟Butterworth滤波器设计数字低通滤波器！(Analog filter design using Butterworth digital low-pass filter!)
- 2009-12-14 19:50:02下载
- 积分：1
-
ACOR
Ant Colony Optimization (ACO) is an optimization metaheuristic based on the foraging behavior of ants. This metaheuristic was originally proposed to find good solutions to discrete combinatorial problems. Many extensions of the ACO heuristic for continuous domain have been proposed, but even those that claim close similarity with classical (discrete domain) ACO, like ACOR, do not use the heuristic information called visibility, commonly used in the original ACO algorithm. In this paper, we show the importance of the visibility in ACO, by proposing ACOℝ -V , a variant of ACOR that performs better in a number of benchmark functions.
- 2014-12-14 21:18:24下载
- 积分：1
-
e_e
Rod Boundary Condition Tor tor
- 2012-04-24 20:30:27下载
- 积分：1
