代码搜索：识别算法
找到约 10,000 项符合「识别算法」的源代码
代码结果 10,000
www.eeworm.com/read/346766/11723940
doc 算法实验.doc
www.eeworm.com/read/345927/11781888
m 传统算法.m
clear all
q=imread('pic.bmp'); %导入图像
q1=imread('pic1.bmp');
for i=1:300
for j=1:250
rect=[i j 99 39];
q2=imcrop(q,rect);
r(i,j)=corr2(q1,q2);
objvalue(i
www.eeworm.com/read/156306/11813278
doc 蚂蚁算法.doc
www.eeworm.com/read/258725/11846669
m 传统算法.m
clear all
q=imread('pic.bmp'); %导入图像
q1=imread('pic1.bmp');
for i=1:300
for j=1:250
rect=[i j 99 39];
q2=imcrop(q,rect);
r(i,j)=corr2(q1,q2);
objvalue(i
www.eeworm.com/read/155593/11861808
cpp 星期算法.cpp
#include
#include
void main()
{
int Ydiff,Ddiff,Mdiff;
char *DAY[7]={"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};
int cd,cm,
www.eeworm.com/read/155562/11863297
cpp strcmp算法.cpp
///////////////////////字符匹配///////////////////////////////
/// strcmp ///
/// str1,str2分别为比较的两个字符串; ///
/// 匹配则返回值为true,否之返回false; ///
/// 作者:mystory ///
www.eeworm.com/read/155095/11898967
txt 算法比较.txt
破圈法，边割法，避圈法的比较：
当图为连通且边树较少时，用破圈法较好
当图边数较多时，使用边割法和避圈法较好
www.eeworm.com/read/344069/11910337
doc 基本算法.doc
www.eeworm.com/read/344069/11910344