资源列表
hqxlh
- 一个曲线拟合源码 在Visual C++下调试通过-a curve fitting source in Visual C debugging through
IDPDENS1
- 用差分方法求解沃尔泰拉方程，此处为一个变元的方程，由于该方程同时含有微分和积分，一般求解有一定的困难。-use of the finite difference method for Volterra equation here as a variable element of the equation, As the same time contain differential equations and integral, the general solution is definitely
SOR
- sor方法求解方程组 用c++软件开发的源代码
ycomb
- Y-combinator 解决fibonacci数列的一个实现，实现了不定义函数名称而实现递归的过程-Y-combinator solve a fibonacci series to achieve, the realization of the non-defined function name to achieve the process of recursive
dijkstra
- Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path
RSA
- 加密编码 利用RSa进行加密编码 是一种比较简单快捷的加密算法-jiamibianma liyong RSa jiamibianma
RemoveBlackConnectedComponents
- 使用opencv去掉二值化图像中黑色面积较小的连通域。 程序中语句 tmparea = fabs(cvContourArea(contour)) 可以得到当前连通域的面积，当此面积小于阈值时对其填充为白色。 rect = cvBoundingRect(contour,0) 得到的是框住连通域的最小矩形，对矩形中的黑色部分将其填充为白色，但是这样的话，连通域6和4两个连通域被填充成了白色的矩形，这显然不符合我们的要求，这样就要判断此连通域是黑色联通域还是白色连通域，采用的方法是测试矩
skiplist.c.tar
- A skip list is a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary se
huffman-coding
- 该程序是实现输入一串字符后对其进行哈夫曼编码输出-huffman coding
greedy
- 贪心法解决背包问题 可自己设置物品数量和背包总容量-Greedy method to solve the knapsack problem and the number of items can set up their own backpack with a total capacity
plot_ellipse
- 反演问题的误差椭球及及在各个模型空间的投影，应用与得到模型参数的置信区间。-Error ellipsoid and the inverse problem and the projection of each model space, the application of the model parameters and obtain confidence intervals.
sanjiaopaofen
- 北邮大二算法设计与分析 关于三角剖分启发式的算法实现-BUPT sophomore algorithm design and analysis heuristic algorithm implementation on triangulation