Extended Kalman Filter

频繁项集挖掘采用spark实现的并行化挖掘算法（并行的apriori算法和b并行的  fp_growth算法）。并行的apriori算法采用scala编写，并行的fpgrowth采用java编写。里面会有较多函数使编程的内容。                                                                                                                                             &

卡尔曼滤波简介

决策树是用二叉树形图来表示处理逻辑的一种工具。可以直观、清晰地表达加工的逻辑要求。特别适合于判断因素比较少、逻辑组合关系不复杂的情况。 -Decision tree is a tree-shaped diagram used to indicate the processing logic as a tool. Can be intuitive, clear logic processing requirements. Particularly suited to determine the factors that have relatively less logical combination of relations with complex situations.

原创的可实现大小写的相互转化-original case is the realization of the mutual conversion

一个根据给定的图，计算出最小生成树的程序-according to a set plan, the calculated minimum spanning tree procedures

用opencv写的行人检测代码，其中用到的特征是harr行人特征，图像是基于彩色图像的。分类器是自己选训练的。

This is a program that will let you calculate roots with the Quadratic formula (including complex roots), Factorial of a number, Fibonacci series (and Pascals Triangle still under construction).

insertion排序-Insertion sort

基于opcv的实例，提供实例源码，欢迎下载-Based on opcv instance, provide examples of source code, please download the

此项目信纸被为了让你启动并运行快速与 MC9S12DG128B 的 CodeWarrior。它是为所选的 CPU 和目标连接设置但是，可以容易地修改。