搜索资源列表
permanent
- Computes the permanent of a nonnegative integer matrix. Notes: Compile in C++, \"g++ -o permanent permanent.c\". -Computes the permanent of a nonnegative in teger matrix. Notes : Compile in C, "g-o permanent permane
hafnian
- Computes the hafnian of a nonnegative integer matrix. Notes: Copy hafnian.c to main.c, in the same directory as Rothberg s code (see above). You can download the .tar directory with the code weighted-match.tar here. Then
binomial
- ％ binomial.m by David Terr, Raytheon, 5-11-04, from mathworks.com ％ Given nonnegative integers n and m with m<=n, compute the ％ binomial coefficient n choose m.
newtons_algorithm_for_nnls
- 文献1的仿真程序 solves the linear least squares problem with nonnegative variables = using the newton s algorithm in [1]. [1] Portugal, Judice and Vicente, A comparison of block pivoting and ％ interior point algorithms
基于贝叶斯网络的半监督聚类集成模型
- 已有的聚类集算法基本上都是非监督聚类集成算法,这样不能利用已知信息,使得聚类集成的准确性、鲁棒性和稳定性降低.把半监督学习和聚类集成结合起来,设计半监督聚类集成模型来克服这些缺点.主要工作包括:第一,设计了基于贝叶斯网络的半监督聚类集成(semi-supervised cluster ensemble,简称SCE)模型,并对模型用变分法进行了推理求解;第二,在此基础上,给出了EM(expectation maximization)框架下
permanent
- Computes the permanent of a nonnegative integer matrix. Notes: Compile in C++, "g++ -o permanent permanent.c". -Computes the permanent of a nonnegative in teger matrix. Notes : Compile in C, "g-o permanent permanent
hafnian
- Computes the hafnian of a nonnegative integer matrix. Notes: Copy hafnian.c to main.c, in the same directory as Rothberg s code (see above). You can download the .tar directory with the code weighted-match.tar here. Then
binomial
- ％ binomial.m by David Terr, Raytheon, 5-11-04, from mathworks.com ％ Given nonnegative integers n and m with m<=n, compute the ％ binomial coefficient n choose m. - Binomial.m by David Terr, Raytheon, 5-11-04, f
newtons_algorithm_for_nnls
- 文献1的仿真程序 solves the linear least squares problem with nonnegative variables = using the newton s algorithm in [1]. [1] Portugal, Judice and Vicente, A comparison of block pivoting and ％ interior point algorithms
nmf
- Code to run the Non-negative Matrix Factorization algorithm as presented in the Lee, Seung 1999 Nature paper.
nmf_toolbox_ver1.4
- 非负矩阵分解的matlab代码，内容全！希望对大家有用-Non-negative Matrix Factorization of matlab code, the contents of the whole! Hope useful for everyone
10077
- The Stern-Brocot Number System The Stern-Brocot tree is a beautiful way for constructing the set of all nonnegative fractions m / n where m and n are relatively prime.-The Stern-Brocot tree is a beautiful way for
shortpaths
- Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest path from s to every other vertex-Given a graph G = (V, E), where every edge e has a nonnegative w
nmfpack
- 非负矩阵分解源代码,有经典NMF，LNMF,NMFsc,developped by patrik hoyer-Nonnegative matrix factorization LNMF,NMFsc,developped by patrik hoyer
euclids__game
- 欧几里德的两个后代Stan和Ollie正在玩一种数字游戏，这个游戏是他们的祖先欧几里德发明的。给定两个正整数M和N，从Stan开始，从其中较大的一个数，减去较小的数的正整数倍，当然，得到的数不能小于0。然后是 Ollie，对刚才得到的数，和M,N中较小的那个数，再进行同样的操作……直到一个人得到了0，他就取得了胜利。-Two players, Stan and Ollie, play, starting with two natural
NMF
- 该软件可实现传统的NMF非负矩阵分解，希望能对大家有所帮助！-This software can realize non-negative matrix factorization. I hope it is helpful for all of us.
factorial
- The factorial of a nonnegative integer n is written n! (pronounced “n factorial”) and is defined as follows: n! = n • (n - 1) • (n - 2) • ... • 1 (for values of n greater than or equal to 1) and
dijkstra
- Dijkstra Algorithm - a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing.
Long_product
- Find a product of two long nonnegative numbers
Nonnegative
- Used to annotate a value that should only contain nonnegative values.