-
KKDZSXX
扩展卡尔曼滤波与无迹卡尔曼滤波的跟踪滤波性能的比较()
- 2020-10-08 14:57:36下载
- 积分：1
-
YCYB6
线性拟合和二次拟合函数 pdg正交多项式作最小二乘拟合(Least Square fitting of Linear fitting and Quadratic fitting function pdg orthogonal polynomial)
- 2018-09-05 21:15:07下载
- 积分：1
-
knn_svm_tree
说明： 对于iris数据集的knn、svm、决策树算法分类的简单实现(Simple implementation of KNN, SVM and decision tree algorithm classification for iris dataset)
- 2020-10-13 17:06:06下载
- 积分：1
-
ltlk4
FIR Filter Design This chapter treats the design of linear-pha()
- 2018-02-07 09:12:27下载
- 积分：1
-
jptimized
超长整形数据计算程序,达到128位,同时计算速度进行了优化(The calculation program of super-long shaping data reaches 128 bits, and the calculation speed is optimized at the same time.)
- 2018-08-04 16:51:49下载
- 积分：1
-
Source-code-of-Database
此代码是针对数据库教材的源代码，包括求“输入的两个数的最大公约数和最小公倍数”、“输入工资输出工资水平”。程序在Access上得到了验证，也可以移植到其他数据库上。(This code is aimed at teaching book of source code, including database for "input the two Numbers when the largest and smallest LCD", "input output wages." wages Program in the Access is verified, also can be transplanted into other database.)
- 2011-07-29 17:26:01下载
- 积分：1
-
Implementation of convex hull
实现凸包实现，采用MATLAB编写代码，用于凸包算法的快速实现。(Implementation of convex hull)
- 2017-06-12 09:42:28下载
- 积分：1
-
carymete
追敢法,主要是n阶线形方程组Ax b的列主元高斯消去法的一个特殊情况,为上三角矩阵,通用程序如附件所示()
- 2018-05-12 19:00:34下载
- 积分：1
-
bostorder
此为人工智能中的简单遗传算法的实现,使用的开发工具为c#(This is the implementation of simple genetic algorithm in artificial intelligence. The development tool used is c#)
- 2018-11-12 15:11:41下载
- 积分：1
-
Python-for-Finance-Second-Edition-master
Python是一种面向对象、解释型计算机程序设计语言，其应用领域非常广泛，包括数据分析、自然语言处理、机器学习、科学计算以及推荐系统构建等。 本书用Python语言来讲解算法的分析和设计。本书主要关注经典的算法，但同时会为读者理解基本算法问题和解决问题打下很好的基础。(Python is an object-oriented, interpretive computer programming language. It has a wide range of applications, including data analysis, natural language processing, machine learning, scientific computing and recommendation system construction. This book uses Python language to explain the analysis and design of algorithms. This book focuses on classical algorithms, but at the same time it will lay a good foundation for readers to understand basic algorithms and solve problems. The book consists of 11 chapters. The tree, graph, counting problem, inductive recursion, traversal, decomposition and merging, greedy algorithm, complex dependency, Dijkstra algorithm, matching and cutting problem, difficult problem and its dilution are introduced. The book has exercises and reference materials at the end of each chapter, which provides readers with more convenience for self-examination and further stu)
- 2018-11-24 15:20:49下载
- 积分：1
