资源列表
[数学计算/工程计算] mat_multi
说明:A program to find the best order to be considered for multiplying matrices so that we can reduce the number of multiplication operation as it is a costly operation.It includes a source code (.c), input file(.txt) and the output file.-A program to fin<cbeauty> 在 2025-11-10 上传 | 大小:2kb | 下载:0
[matlab例程] huffmam_decoding
说明:the decoding of Huffman codes is shown. For the decoding the coding tree has to be constructed using the information which has to be transmitted as well. Following that the input is read bitwise and for each 0 a left turn is taken and for each one<hazhiriq200> 在 2025-11-10 上传 | 大小:2kb | 下载:0
[matlab例程] smithchart
说明:The Smith chart, invented by Phillip H. Smith (1905-1987),[1][2] is a graphical aid or nomogram designed for electrical and electronics engineers specializing in radio frequency (RF) engineering to assist in solving problems with transmission lines a<hazhiriq200> 在 2025-11-10 上传 | 大小:2kb | 下载:0
[数据结构常用算法] LCSProblem
说明:LCS算法: 通常两个字符串的最大公共子串的问题是通过下面的算法来完成的: 把字符串1(长度m)横排,串2(长度n)竖排,得到一个m×n的矩阵c,矩阵的每个元素的值如下,如果m[i]=n[j],则c[j][i]=1,否则,c[j][i]=0。然后找出矩阵中连续是1的对角线最长的一个,则对角线的长度就是公共子串的长度.-LCS algorithm: often the two most common sub-string string problem is through the fol<sdf> 在 2025-11-10 上传 | 大小:2kb | 下载:0
[人工智能/神经网络/遗传算法] knn2
说明:k-nearest neighborhood is a one method that select k number of units in such as cluster that this k units are nearest from the cluster center-k-nearest neighborhood is a one method that select k number of units in such as cluster that this k units ar<ali> 在 2025-11-10 上传 | 大小:2kb | 下载:0
[matlab例程] project22312matlab
说明:this is sample source code for fingerprint verification for matlab<amer> 在 2025-11-10 上传 | 大小:2kb | 下载:0
[matlab例程] createLine3d
说明:Create Line 3d to connect between two planes<michel badr> 在 2025-11-10 上传 | 大小:2kb | 下载:0