资源列表
AHP+TOPSIS
- 层次分析法和逼近理想法结合从而选取最优网络(Analytic Hierarchy Process and Approximation Ideal Method to Select Optimal Network)
coutour
- Opencv用cvFindContours方法获取获取的轮廓,获取这些轮廓内部的像素点坐标等信息(Opencv uses the cvFindContours method to get the contour and get the information such as pixel coordinates.)
randomgraph
- 该源程序可用于直接生成网络随机图,同时进行静态特征的分析,专门为供初学者学习使用,便捷。。。。。。(The source program can be used to directly generate network random graphs, while analyzing static characteristics, which is specially for beginners to learn and use.)
LQBWXQG
- 计算方法,或者是数值计算的 wymspline样条插值 自己做的()
矫正提取的二维码
- 对于提取的不同方向的二维码进行矫正,从而可以进行二维码的识别(Correcting the extracted two-dimensional codes in different directions so that the two-dimensional codes can be identified)
新建文件夹
- c语言的一些小程序,其中有一些是oj上的小题目,n阶矩阵m次幂,以及计算最短距离点(Some small programs in c language, some of which are small topics on oj, n-th order matrices of m, and the calculation of shortest distance points)
KFCMClust
- 实现KFCM聚类,希望对你有所帮助,代码有注释(Realize KFCM clustering, hope to help you, the code has comments.)
méthode otsu
- c'est une methode de seuillage
bubu-transport
- 高精度整数问题 问题描述, 设计一个表示高精度整数的模板类()
MinDistance
- 算法的步骤如下: 1.找出Sx的中位数:median_Sx;用median_Sx对点集S进行划分,左边的为S1,右边的为S2; 2.分别求出S1和S2中的最近点对,设S1和S2中最近点对的距离分别为:delta(S1), delta(S2); T(n)= 2*T(n/2)+O(n). 由主定理,可知T(n) = O(n*log(n));(The steps of the algorithm are as follows: 1., find out the median
one
- 从键盘输入一个班(全班最多不超过30人)学生某门课的成绩,当输入成绩为负值时,输入结束,分别实现下列功能: (1)统计不及格人数并打印不及格学生名单; (2)统计成绩在全班平均分及平均分之上的学生人数,并打印这些学生的名单; (3)统计各分数段的学生人数及所占的百分比。(Enter a class from the keyboard (no more than 30 people in the class). When the input results are negative
皮肤_易语言皮肤
- 几十种易语言皮肤切换,模块源码,方便各类UI设计使用(Dozens of easy language skin handover, module source code)