资源列表
boosting_demo
- boosting算法用于集成学习，包含多种弱分类器(Boosting algorithm is used for ensemble learning, and it contains many weak classifiers)
3次B样条曲线拟合
- 离散点曲线 进行3次B样条曲线拟合 包括节点参数化过程 基函数计算过程 控制点反求过程 到最后拟合曲线的显示(The discrete point curve is fitted with 3 B spline curves, including the node parameterization process, the basis function calculation process, the control point inversion process, and the final
1.joseph（约瑟夫）
- 解题思路： 用一个不带头节点的循环链表来处理joseph问题：先构成一个有n个节点的单向循环链表，然后从第k结点从1开始计数，计数到m的时候，对应结点从链表中删除。然后再从被删结点的下一个节点继续从1开始计数.......,以此类推，直到所有的结点都列出时，程序结束。(Problem solving: With a circular linked list node don't take the lead to handle the problem of Joseph: first cons
2.表达式计算
- 思路： 1、创建两个栈 linkstack * operand ;//运算数栈 linkstack * operator;//运算符栈 2、扫描表达式。 <1>若是运算数,合并成一个完整的数data。 规则：直接入操作数栈 push_stack(operator_stack,data);(Ideas: Create two stacks Linkstack * operand;/ / operation number stack Linkstack * opera
wvsnmodel-v4
- gtty yhvychy5 yh6yv56ychy
PhotoDocPro
- ythv yh yhuji8nl kiolm;pkbuji8
哈夫曼树
- 哈夫曼树，又叫最优二叉树，指的是对于一组具有确定权值的叶子结点的具有最小带权路径长度的二叉树。(The haffman tree, also known as the optimal binary tree, refers to a binary tree with a minimum path length for a set of leaf nodes with determinate weights.)
A星算法matlab源码及详细注释
- A*算法路径规划，程序中采用随机障碍物，通过躲避障碍物来完成路径的规划(A* algorithm; path planning)
031
- MATLAB求图像中心；包含朴素贝叶斯代码等等(MATLAB for image centers, including plain Bias code, and so on)
rbg
- 简单龙贝格算法的应用，在一定的误差限下用龙贝格算法计算定积分以及牛顿法解非线性方程组(The application of simple Romberg algorithm, in the error limit with Romberg algorithm for integral calculation, Newton method for solving nonlinear equations)
138_861001004636862 (2017-7-5)
- 还不不不不不不不本不该把吧科技博客不版本卡基本背靠背是本科基本是肯定不开机卡不(bjehhsbsb bbfjsbf hfhsfbs ngbsjbg jbjgbjb jbj j nnajbgkjakkn)
fe885
- There are cycle detection, periodic testing, PLS PLS toolbox, Noisy pulse correlation detection signal.