资源列表
AP
- 近邻传播聚类算法，简称AP算法，是由Science中的一篇文章提出来的，与以往的聚类方法相比，此方法可以更快地处理大规模数据，得到较好的聚类结果。-Neighbor propagation algorithm, referred to as the AP algorithm, is an article in Science in the past, with previous clustering methods, this method can handle large data faste
zuoye1_shuzhu
- 流水调度的数组简单算法。n个作业要在由俩台机器M1和M2组成的流水线上完成加工。每个作业的顺序都是现在M1上加工，然后在M2上加工。这个问题要求确定这n个作业的最优加工顺序，使得从第一个作业M1上开始加工，到最后一个作业在机器M2上加工完成所需的时间最短-Array of simple flow scheduling algorithm. n a job in the two machines M1 and M2 components of the pipeline to complete pr
cannyTut2
- canny algorithm in c++
transpose
- 实现稀疏矩阵的转置功能，能使时间复杂度为n（矩阵的行数或者列数）-Achieve sparse matrix transpose function, make the time complexity is n (the matrix rows or columns)
Fortran
- fortran的一些常用算法，希望对大家有帮助-fortran some of the commonly used algorithms, we want to help
A_Tutorial_on_Spectral_Clustering
- 谱聚类的最新英文教程，详细描述了谱聚类的每一个步骤，讲解清晰明了，想现在最实用最全面的谱聚类基础教程。-In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved eciently by standard linear algebra software, and
google-all-pairs-similarity-search
- Google ALL-Pairs算法源码-Google ALL-Pairs algorithm source code
Dijkstra
- 经过修改后的Dijkstra算法的c++实现，可以输出任意点到初始点的最短距离。-After the modified Dijkstra algorithm c++ implementation of any point can be output to the initial point of the shortest distance.
dj
- 一个最小生成树算法，一个dj算法，其中每个算法是以例题的形式出现的，希望对大家有帮助-A minimum spanning tree algorithm, a dj algorithm, which is based on each algorithm in the form of examples, we want to help
fcfs
- 作业调度算法资源分配要求： 主存分配要求：a优先分配主存的低地址区域且不准移动已在主存中的作业。 b 主存中参与多道运行的作业平分CPU时间 磁带机和打印机：采用静态分配，即在作业运行前就把所需的设备分配给它 -Resource allocation algorithm for job scheduling requirements: allocation of main memory requirements: a low priority in the allocatio
shannon
- haffman coding example c-haffman coding example c++
rbtree
- 实现红黑树的相关算法，红黑树、二叉搜索树的实现和性能比较-Red-black tree, binary search tree implementation and performance comparison