-
粒子滤波重采样（13种方法）resampling methods for particle filtering
I have developed a serial of resampling methods for particle filtering in Matlab as attached below in separate .m files that you may have interest and that you may have better implementation than me, or if you have any question, your feedback will be appreciated.
These resampling methods together with their pseudo-codes
- 2022-06-12 23:28:12下载
- 积分：1
-
哈夫曼树的应用
哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。
- 2022-07-11 16:27:25下载
- 积分：1
-
３D
３D-FDTD防真，边界为廖氏差分格式,程序使用计算机内存较少，可以用来做稍大尺寸物体的电磁防真-3D-FDTD defense truthfulness, Liao borders difference format, procedures use less computer memory. can be used to do slightly larger size object electromagnetic defense really
- 2023-04-03 01:00:03下载
- 积分：1
-
normal dft
标准dft，是标准的dft，虽然没有特别的地方，但对于了解其内涵或许有一定的帮助-normal dft
- 2023-01-25 06:50:04下载
- 积分：1
-
简单的循环链表算法
简单的循环链表算法-simple algorithm cycle Chain
- 2022-11-14 00:40:03下载
- 积分：1
-
高效数据类型和算法库，含很多数值算法
高效数据类型和算法库，含很多数值算法-high efficient data structure and algorithm, including a variety of algorithms and numeric computings.
- 2023-06-15 23:35:03下载
- 积分：1
-
works numerical algorithm commonly used language _C
工程常用数值算法＿C语言-works numerical algorithm commonly used language _C
- 2023-07-04 18:40:05下载
- 积分：1
-
Kernelized Correlation Filters(KCF)算法
资源描述目前在online visual tracking这个领域，已经涌现出很多的跟踪算法，比较知名如TLD，Struck，OAB，CT 等等。但是能做到非常快速而且效果还不错的相对就较少了，好多算法都是刚刚能实时，而且还是在图像分辨率不是很大的情况下。之前在博客里提到一篇该领
- 2022-07-14 05:51:15下载
- 积分：1
-
LZW压缩算法实现 VC++6.0工程
资源描述一个不错的LZW压缩文件算法示例代码，才用VC6.0写的，可以编译通过，压缩效率还不错，我测试过简单的位图比gif/png等格式压缩效率都要高！！！
- 2022-08-25 04:08:59下载
- 积分：1
-
issue a travel home to travel home to drive a car with the minimum of cost yi us...
旅行家问题 一个旅行家想驾驶汽车以最少的费yi 用从一个城市到另一个城市（假设出发时油箱是空的）。给定两个城市之间的距离为D1、汽车油箱的容量为C(以升为单位），每升汽油能行驶的距离为 D2，出发点每升汽油价格P和沿途油站数N（N可以为零），油站i离出发点距离Di,每升汽油价格Pi(i=1,2...N)。计算结果四舍五入至小数点后两位。 如果无法到达目的地，则输出“No Solution"。-issue a travel home to travel home to drive a car with the minimum of cost yi used from one city to another city (assuming starting at the fuel tank was empty). Given the two cities for the distance between D1, car fuel tank capacity of the C (in liters) per liter petrol traveling distance to the D2, the starting point liter gasoline prices P and several petrol stations along the N (N can be zero), PFS i distance from the starting point Di per liter Steam oil prices Pi (i = 1,2 ... N). Calculation results rounded to two decimal places. If unable to reach their destination, the export of "No Solution."
- 2023-09-07 00:25:03下载
- 积分：1
