Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - test.m
Search - test.m - List
train程序能进行语音模板训练,test来用识别,即模板匹配的过程,采用DTW算法,通过反复训练模板能有较高的识别率-run train.m for templats training,and test.m for templates matching by using DTW.
Update : 2024-05-08 Size : 6144 Publisher :

model of GW transport test in matlab
Update : 2024-05-08 Size : 1024 Publisher : irfan

matlabfsk
DL : 0
test m-file for fsk modulation
Update : 2024-05-08 Size : 2048 Publisher : Andy Kim

DL : 0
as3 加载mp4本地视频解码,经测试绝对可以用。-as3 load mp4 local video decoding, the test can definitely use.
Update : 2024-05-08 Size : 5120 Publisher : 方猛

读写XPG格式图像文件 imreadxpg.m 读XPG格式图像文件 imwritexpg.m 写XPG格式图像文件 cameraman.xpg 一个XPG格式图像文件 test.m 测试文件-Read and write XPG image file format imreadxpg.m read XPG XPG XPG format image files imwritexpg.m write image file format image file format cameraman.xpg XPG test.m a test file
Update : 2024-05-08 Size : 8192 Publisher : sinahust

matlablm
DL : 0
最小二乘拟合的c++实现,使用差分,在matlab中设置c++编译器为vc++2005或以上,运行test.m即可-Least-squares fit in c++ set compiler as vc++ in matlab then run test.m
Update : 2024-05-08 Size : 4096 Publisher : 王聪

图像匹配的实现,其中match.m:测试程序,sift.m :尺度不变特征变换(SIFT算法)的核心算法程序,appendimages.m: 该函数创建一个新的图像分别包含两个匹配的图像和他们之间的匹配对的连接直线,可以运行。 -The realization of image matching, which match.m: test program, sift.m: scale-invariant feature transform (SIFT algorithm) of the core algorithm, appendimages.m: This function creates a new image each consists of two images and matching match between them on the connection line, you can run.
Update : 2024-05-08 Size : 2710528 Publisher : 刘辉龙

DL : 0
约瑟夫问题 设有n个人站成一圈,每个人有不同的编号i(1≤i≤n)。从编号为1的人开始按顺时针方向“1,2,3,4…”循环报数,数到m的人出列,然后从出列者的下一个人重新开始报数,数到m的人又出列,如此重复进行,直到n个人都出列为止。约瑟夫问题是:对于任意给定的n个人的原始排列顺序和m值,求出n个人的出列顺序。 例如,当8个人的原始排列顺序为 1 2 3 4 5 6 7 8 并且m=4时,其出列顺序为 4 8 5 2 1 3 7 6 -Documents and Settings
Update : 2024-05-08 Size : 1024 Publisher : 段磊

DL : 0
Test : a basic Matlab fonction to compute simple series.
Update : 2024-05-08 Size : 1024 Publisher : smushing

DL : 0
简单局域网聊天程序编写(C#)以及TCP协议的使用方法介绍-my english is very poor ,i m very sorry.
Update : 2024-05-08 Size : 352256 Publisher : 范书铭

DL : 0
脉冲检测:51单片机12M晶振精确定时1S ,P3.2口用来接外部脉冲,并将检测次数显示在LCD1602上!-Pulse test: 51 SCM 12 M crystals precise timing 1 S, P3.2 mouth used to pick up external pulse, and will be testing number displayed in the LCD1602!
Update : 2024-05-08 Size : 32768 Publisher : jtao

matlabtest
DL : 0
function mean = ml_mean(data) Calculate the maximum likelihood estimation of the mean Written by Christiaan M. van der Walt Meraka Institute More resources available at http://www.patternrecognition.co.za Reference: C.M. van der Walt and E. Barnard,“Data characteristics that determine classifier perfromance”, in Proceedings of the Sixteenth Annual Symposium of the Pattern Recognition Association of South Africa, pp.160-165, 2006. Available [Online] http://www.patternrecognition.co.za-function mean = ml_mean(data) Calculate the maximum likelihood estimation of the mean Written by Christiaan M. van der Walt Meraka Institute More resources available at http://www.patternrecognition.co.za Reference: C.M. van der Walt and E. Barnard,“Data characteristics that determine classifier perfromance”, in Proceedings of the Sixteenth Annual Symposium of the Pattern Recognition Association of South Africa, pp.160-165, 2006. Available [Online] http://www.patternrecognition.co.za
Update : 2024-05-08 Size : 35840 Publisher : Ayike Simsek

DL : 0
素数测试问题, 如果把乘、除法(包括取模)看成常数时间, 则算法的时间复杂度为 (k)=  (log m)=O(log n)。 而当n极大时,与n在同一数量级的两个数相乘除, 不超过O(log2n)次二进制位操作。 ∴算法的时间复杂性为O(log3n)二进制位操作 -Prime test, If the multiplication, division ( including the modulus as a constant time ), The time complexity of the algorithm is ( k ) = ( log m ) = O ( log n ). And when the N-pole greatly, and N in the same order of magnitude of two numbers multiplication and division, Not more than O ( log2n ) binary bit operations. Now the time complexity of the algorithm is O ( log3n ) binary operation
Update : 2024-05-08 Size : 1024 Publisher : 朱茵茵

基于智能算法的在几个测试函数上测试鲁棒性的M文件。可直接运行run_文件。-Some codes for the tests on benchmark functions on the basis of intelligence algorithms.
Update : 2024-05-08 Size : 3072 Publisher : 李白

用LU分解求解线性方程组,有Lbacksub.m LUFactor.m Ubacksub.m test.m四个m文件和一个txt运行结果,数值分析-solve linear system by LU ,numeriacal analysis
Update : 2024-05-08 Size : 2048 Publisher : 李刚

DL : 0
Perform a Jarque and bera test and return test statistique
Update : 2024-05-08 Size : 1024 Publisher : thoms

DL : 0
Perform a student test on parameters
Update : 2024-05-08 Size : 1024 Publisher : thoms

DL : 0
素数测试问题(Monte Carlo算法) 求am(mod n)的算法(m≤n) 设m的二进制表示为bkbk-1…b1b0(bk=1,且k≈log2m)。 例:m=41=101001(2),bkbk-1…b1b0=101001,(k=5)。 求am可以用下述方法:初始C←1。 -Prime number test problem ( Monte Carlo algorithm) Seek am ( MOD n ) algorithm ( M = n) A m binary representation for bkbk-1... B1b0( BK = 1, and K = log2m ). Example: M = 41= 101001(2), bkbk-1... B1b0 = 101001, ( k = 5). Ask am can use the following method: initial C-1.
Update : 2024-05-08 Size : 34816 Publisher : viola

MATLAB人脸识别,运行TEST.m文件看效果就可以了,完成的功能就是识别人脸并标记起来。-MATLAB+human face recognition,run TEST.m to show the performance,To be sure that images in the images file are in the same size,
Update : 2024-05-08 Size : 46080 Publisher : jackson

压缩文件包含两部分,一部分为捷联惯导的基本内容,是.ppt,一共五章。还有一部分为捷联惯导的解算程序,共九个,是.m文件。用的时候需要将数据的txt文档放在文件夹内,运行test.m即可。-The compressed file contains two parts, one for the sins of the basic ppt, a total of five chapters. SINS solver, a total of nine, is the m files. Used when data txt file on the folder, run test.m can.
Update : 2024-05-08 Size : 4096 Publisher : xiaoxiao
« 1 2 3 4 5 67 8 9 10 11 ... 36 »
DSSZ is the largest source code store in internet!
Contact us :
1999-2046 DSSZ All Rights Reserved.