搜索资源列表
mintreek
- 图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5
pp
- the antenna balanis 3th
pp
- matlab code for object detection as well as our eyes can do
pp
- 投影寻踪算法，对高光谱图像进行降维和检测处理-Projection pursuit algorithm for hyperspectral image dimensionality reduction and detection processing
B-ELM
- Bidirectional extreme learning machine - B-ELM Y. Yang, Y. Wang, and X. Yuan, "Bidirectional extreme learning machine for regression problem and its learning effectiveness," IEEE Transactions on Neural Networks and Learning Systems, Vol. 23, pp.
Weighted-ELM-Codes-for-Binary-Problems
- Weighted ELM for imbalanced datasets - Weighted-ELM W. Zong, G.-B. Huang, and Y. Chen, “Weighted extreme learning machine for imbalance learning,” Neurocomputing, vol. 101, pp. 229-242, 2013.
C-PP-XML-reader-library
- C++ XML读写类库，包括expat，xerces，tinvxml，Cmarkup等-C++ XML reader library, including the expat, xerces, tinvxml, Cmarkup etc.