代码搜索:协方差矩阵

找到约 10,000 项符合「协方差矩阵」的源代码

代码结果 10,000
www.eeworm.com/read/219121/14893655

m readsigimages.m

% ReadSigImages % 读取文件,并提取每幅图像的特征 % 返回 % featureVector 特征矩阵,每一列表示一个样本 % classLabVector 样本类标 % by kofsky 6.3 function [featureVector,classLabVector]=ReadSigImages(filepath) % 读取包含签字文件的文件夹名 All
www.eeworm.com/read/218562/14915466

m test0616.m

%%%%%%%%数字图像Huffman压缩编码实现%%%%%%%%%%%%%%%%%%% clc clear J=imread('cameraman.tif'); title('原始图象'); imshow(J); I=double(J); %load wbarb; [m,n]=size(J); %%%%%%将矩阵的不同数统计在数组c的第一列中%%%%%%%%%%%%
www.eeworm.com/read/116248/14982140

cpp mincostree.cpp

//图的邻接矩阵表示,求最小生成树算法 #include "iostream.h" #include "stdio.h" #include "assert.h" //#include "sqlist.h" #include "minheap.h" #include "USET.H" //#include "minspantree.h" #include "Graph.h"
www.eeworm.com/read/115294/15019046

cpp mincostree.cpp

//图的邻接矩阵表示,求最小生成树算法 #include "iostream.h" #include "stdio.h" #include "assert.h" //#include "sqlist.h" #include "minheap.h" #include "USET.H" //#include "minspantree.h" #include "Graph.h"
www.eeworm.com/read/115029/15028807

c nizhen.c

#include "stdio.h" #define MAX 10 int main(void) { float a[MAX][MAX],b[MAX][MAX]; int i,j,k; float t,n; printf("请输入原方阵的阶,不大于%d: ",MAX); scanf("%f",&n); printf("请按行序输入矩阵:\n");
www.eeworm.com/read/215702/15052562

cpp 7_9.cpp

//7_9.cpp 文件三,主函数 #include "linequ.h" //类声明头文件 void main() //主函数 { double a[]= //方程系数矩阵 { 0.2368,0.2471,0.2568,1.2671, //第一行 0.1968,0.2071,1.2168,0.2271, //第二行 0.1581,1.1675,0.1768
www.eeworm.com/read/209499/15218201

asv max_th.asv

function [soft_out,ex_info]=max_th(n,app) %**************************************************************** % 内容概述:子译码器。 % 利用硬件化的方式实现TURBO码的MAX-LOG-MAP译码 % 生成矩阵按照3GPP标准为[1 1 0 1;
www.eeworm.com/read/208856/15234223

cpp algo0702.cpp

Status CreateUDN(MGraph &G) {// 算法 7.2 // 采用数组(邻接矩阵)表示法,构造无向网G。 int i,j,k,w; VertexType v1,v2; printf("G.vexnum :" ); scanf("%d",&G.vexnum); printf("G.arcnum :"); scanf("%d",&G.a
www.eeworm.com/read/207216/15279488

c zhuigan.c

#include #define N 4 main() {float sz[N][N+1],p[N],q[N]; int i,j; printf("请输入增广矩阵:\n"); //输入 for(i=0;i
www.eeworm.com/read/25793/950006

+

### uVision2 Project, (C) Keil Software ### Do not modify ! Target (Target 1), 0x0000 // Tools: 'MCS-51' Group (Source Group 1) File 1,2, 0x0 File 1,1,