资源列表
MyClass
- 线性规划单纯形法的简单c++实现。可以解较为简单的线性规划方程。-This is about simplex-method of linear-program.It is simply to solve the linear programming equation.
fit_fun
- 人工神经网络模式识别算法类、曲线拟合算法类等-Artificial neural network pattern recognition algorithm, curve fitting algorithm etc。
Accepted
- 本文件中大概包含80多道本人在浙江工业大学的ACM网站中提交通过的源代码，非常适合初学者。-acm source codes zjut
12
- 5节点系统的pq快速分解法潮流计算，用的为因子表法-the pq decomposition flow calculation
FCLS-Spectral
- 有关求取全约束最小二乘法的很有权威的一篇文章，建议阅读-ANC abundance nonnegativity constraint ASC abundance sum-to-one constraint AVIRIS airborne visible/infrared imaging spectrometer FCLS fully constrained least squares HYDICE hyperspectral digital imagery collect
A-Bmain
- 高精度的实现A-B的程序，是北邮上ACM训练的题，可以供大家参考学习-Program of high-precision implementation of A-B, is the title of the the BUPT ACM training for your reference study
olsr
- OLSR- is a link state Routing, that uses the shortest path which is preferable first.
communications-of-ACM-201001-dl
- ACM通讯 由美国计算机协会出版的学习刊物-communication of ACM Computer association published by the American learning publications
deadlock_b1994445152006
- Deadlock Algorithm for Operating Systems
EM
- EM算法正确收敛性的探讨，用于在图像处理中图像分割时应用EM，而算法有时不收敛的情况。-The EM Algorithm Convergence of the correct application of the EM for image processing in image segmentation algorithm sometimes does not converge.
graham
- Graham扫描算法 ： 大体思路是将不是凸包顶点的点从点集中去掉。 找出S中具有最小y坐标的点p（通过选取最左边的点打破平局） 根据点和p的连线 与 x轴正方向所成的角度，对S中的点进行排序（由小到大），并将p放在最前面。 从p点开始扫描排序后的S集合。如果这些点都在凸包上，则每三个相继的点p1,p2,p3满足以下性质：p3在向量<p1,p2>的左边.如果出现相继的三个点p1,p2,p3不满足上述性质，则p2点一定不是凸包的顶点，应立即去除。-Grah
clothing-sizes.cpp
- THIS CODE TAKE A PERSON S SIZEZ AS INPUT, AND OUTPUTS HIS/HER S CLOTHING SIZES