代码搜索：Matrix

找到约 10,000 项符合「Matrix」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/324153/13282766

h decodeutil.h

#include #include #include #include int *ivector(int ilow,int ihigh); int **imatrix(int ilow,int ihigh,int jlow,int jhigh); double *vector(int ilow,i
·
www.eeworm.com/read/137875/13284152

htm chap31.htm

Intro to Algorithms: CHAPTER 31: MATRIX OPERATIONS
·
www.eeworm.com/read/137875/13287944

htm chap31.htm

Intro to Algorithms: CHAPTER 31: MATRIX OPERATIONS
·
www.eeworm.com/read/323949/13306884

m ss_tbl31.m

Gold sequences for the table of problem 3.1 of Spread Spectrum Chapter Note that the sequences are the columns of the below matrix not the rows, so we have to take the transpose of the following m
·
www.eeworm.com/read/323831/13314056

h mat_operations.h

// Copyright (C) 2003 Zbigniew Leyk (zbigniew.leyk@anu.edu.au) // and David E. Stewart (david.stewart@anu.edu.au) // and Ronan Collobert (collober@idiap.ch) //
·
www.eeworm.com/read/323831/13314196

h mat.h

// Copyright (C) 2003 Ronan Collobert (collober@idiap.ch) // // This file is part of Torch 3. // // All rights reserved. // // Redistribution and use in source and binary forms,
·
www.eeworm.com/read/238830/13322124

m anal2.m

function [E,Nc,mC,T] = anal2(M,D,st,s); % % Ph.D. Thesis % Copyright by Leandro Nunes de Castro % March, 2000 % Immune Network (iNet) - Description in iNet.doc % Function determines the Minima
·
www.eeworm.com/read/323600/13334362

java ludecomposition.java

package Jama; /** LU Decomposition. For an m-by-n matrix A with m >= n, the LU decomposition is an m-by-n unit lower triangular matrix L, an n-by-n upper triangular matrix U,
·
www.eeworm.com/read/137160/13341924

m iscolumn.m

%ISCOLUMN Checks whether the argument is a column array % % [OK,Y] = ISCOLUMN(X) % % INPUT % X Array: an array of entities such as numbers, strings or cells % % OUTPUT % OK 1 if X is a column
·
www.eeworm.com/read/137160/13342324

m fisherm.m

%FISHERM Optimal discrimination linear mapping (Fisher mapping) % % W = FISHERM(A,N,ALF) % % INPUT % A Dataset % N Number of dimensions to map to, N < C, where C is the number of classes %
·