搜索资源列表
span_forest
- Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, \"g++ -o span_forest span_forest.c\". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper t
LVQ
- TheLVQ program accepts input consisting of vectors and calculates the LVQnetwork weights. If a test set is specified, the winning neuron (class) for each neuron is identified and the Euclidean distance between the pattern andeach neuron is reported.
tlsf
- 算法的许多例子都是最优化问题（ optimization problem），每个最优化问题都包含一组限制条件（ c o n s t r a i n t）和一个优化函数（ optimization function），符合限制条件的问题求解方案称为可行解（ feasible solution），使优化函数取得最佳值的可行解称为最优解（optimal solution）。-algorithm are many examples of optimization problems (optimizati
Fast_Joseph
- 时间复杂度为O(nlogn)的Joseph排列问题的计算程序。程序的运行时间与m无关。在一分钟之内可以计算n=10^6,m任意的Joseph排列问题.-time complexity of O (nlogn) Joseph problems with the program. Procedures for the running time has nothing to do with the m. In a minute can be calculated n = 10 ^ 6, m arbit
LISS_FAST
- 时间复杂度为O(nlogn)的最长单调递增子序列问题的计算程序。不是动态规划算法。在一分钟之内可以计算n=10^6个元素的递增子序列。-time complexity of O (nlogn) of the longest-monotonically increasing sequence of the program. Is not dynamic programming algorithm. In a minute can be calculated n = 10 ^ 6 elements
SerialIO
- matlab I/O program example, this file also include some documents about matlab I/O
distsort
- 该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it's time complexity of O (n), but this sort known to be
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
Strassen矩阵乘法算法 C++程序源码
- Strassen矩阵乘法算法 C++程序源码 V.Strassen在1969年发表了一个算法，将计算两个n阶方阵的乘积的时间复杂性降低到了o（nlog27），被誉为“在代数复杂性理论中最激动人心的结果”。该算法主要适用于方阵的乘法。-Strassen algorithm for matrix multiplication C++ program source V. Strassen published in 1969, an algorithm to compute the product of
EOF
- eof分析的matlab软件包,需要输入的是距平序列，直接调用rest.m文件-a package of matlab codes on EOF analysis，the rest.m file is the main program
bpdetail
- 严格按照BP网络计算公式来设计的一个matlab程序,对BP网络进行了优化设计 优化1：设计了yyy，即在o(k)计算公式时，当网络进入平坦区时(<0.0001)学习率加大，出来后学习率又还原 优化2：v(i,j)=v(i,j)+deltv(i,j)+a*dv(i,j)-BP network in strict accordance with the formula to design a matlab program, the optimized BP network desig
letterrecognition
- 字母图像识别算法，O, E, A, U 四个字母进行识别，该算法加入一定噪声之后依然有效。-The basic goal of the program is to perform letter recognition of vowels O, E, A, U in paragraphs provided in form of black-and-white images. Using the training paragraph image, we are allowed to train ou
prime
- 找n以内的素数的程序，算法复杂度O(n^0.5)-Find the prime numbers below n, the efficiency of the program is O(n^0.5).
Buendatoseguro
- this o program to graph defirent kind of signals and change them, like module, time scale-this is o program to graph defirent kind of signals and change them, like module, time scale
bpdetail
- 严格按照BP网络计算公式来设计的一个matlab程序,对BP网络进行了优化设计 优化1：设计了yyy，即在o(k)计算公式时，当网络进入平坦区时(<0.0001)学习率加大， 出来后学习率又还原 优化2：v(i,j)=v(i,j)+deltv(i,j)+a*dv(i,j) -BP network in strict accordance with the formula to design a matlab program, the BP network optimiz
waveleeet
- o here p q r s t of the electro cardia program is being explained -o here p q r s t of the electro cardia program is being explained
polynomial
- 对已知的多项式p(x)利用用线性表的数据结构进行加法，乘法，微商运算 加法的时间复杂度为O(n+m) 乘法的时间复杂度为O(nm) 微分的时间复杂度为O(n) 排序的平均时间复杂度为O(nlogn) 程序优点：通过顺序表和链表结合使用，使乘法合并同类项的时间复杂度降为O(1)，乘法本身的时间复杂度也达到下界。 程序提供了有好的界面，并且有较好的容错性，输入输出人性化，符合人的习惯。 用快速排序代替了插入排序，使本程序能应对较大的数据。 程序缺点：系数和指数有范围限
matlab--program
- 实现一些数学函数功能，比如求对角阵、单位阵的，-Implement some mathematical functions ，such as o diagonal matrix, unit array,
PCA_ORL
- 这个程序实现了基于主成份的人脸可视化分析,这是一个完整程序代码.-This program implements the main components of the human face based on visual analysis, this is a complete code.
program
- FFT A计权 倍频程分析 三分之一倍频程分析-F F T A w eight o c tave a n al o n e t hird o ctave