代码搜索:LED Matrix

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

代码结果 10,000
www.eeworm.com/read/282286/9106203

c matrix_skyline.c

/* * ============================================================================= * ALADDIN Version 1.0 : * matrix_skyline.c : Functions for Operations on Skyline Matrices. *
www.eeworm.com/read/282286/9106260

c fe_matrix.c

/* * ============================================================================= * ALADDIN Version 1.0 : * fe_matrix.c : Functions to solve (non)linear FE solution procedures *
www.eeworm.com/read/282286/9106273

c matrix_indirect.c

/* * ============================================================================= * ALADDIN Version 1.0 : * matrix_indirect.c : Functions for Matrices having INDIRECT storage pattern. *
www.eeworm.com/read/282286/9106305

c matrix_double.c

/* * ============================================================================= * ALADDIN Version 1.0 : * matrix_double.c : Functions for Matrices of data type double *
www.eeworm.com/read/381148/9107422

cpp matrix_zeros.cpp

#include void matrix_zeros(double *Z,int L,int C) { int k1,k2; for(k1=0;k1
www.eeworm.com/read/281456/9154885

txt data_matrix.txt

1 1 0.5 1 1 0.25 0.5 0.25 2.0
www.eeworm.com/read/183445/9158637

m kernel_matrix.m

function omega = kernel_matrix(Xtrain,kernel_type, kernel_pars,Xt) % Construct the positive (semi-) definite and symmetric kernel matrix % % >> Omega = kernel_matrix(X, kernel_fct, sig2) % % This ma
www.eeworm.com/read/380066/9167040

java matrix_production.java

public class Matrix_Production { public static double[][] Production(double[][] Q, double[][] R, int n){ double[][] c=new double[5][5]; int i,j,k; for(i=0;i
www.eeworm.com/read/380066/9167042

java matrix_transpose.java

import java.lang.*; import java.math.*; public class Matrix_Transpose { public static double[][] Tranpose(double[][] A,int n){ int i,j; double w; for(i=0;i
www.eeworm.com/read/380066/9167044

java matrix_inverse.java

public class Matrix_Inverse { public static double[][] Inverse(double[][] a,int n){ int i,j,k; for(i=0;i