代码搜索:Matrix

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

代码结果 10,000
www.eeworm.com/read/435615/7789106

c lmpar_.c

/* lmpar.f -- translated by f2c (version 20020621). You must link the resulting object file with the libraries: -lf2c -lm (in that order) */ #include #include "minpack.h" #define min(a
www.eeworm.com/read/435615/7789137

c lmpar.c

/* lmpar.f -- translated by f2c (version 20020621). You must link the resulting object file with the libraries: -lf2c -lm (in that order) */ #include #include "cminpack.h" #define min(
www.eeworm.com/read/199981/7813815

txt readmelpp.txt

Q & A: Q: How to use the code? A: You need to put LPP.m, PCA.m in your working directory. If you want to use constrctW to construct the affinity matrix, you should also put constructW.m in your
www.eeworm.com/read/199676/7837383

htm chap31.htm

Intro to Algorithms: CHAPTER 31: MATRIX OPERATIONS
www.eeworm.com/read/399740/7839313

cpp caculate_greatest_eigen.cpp

/************************************************************** * http://pagesperso-orange.fr/jean-pierre.moreau/c_matrices.html* *Calculate the greatest eigenvalue of a real square matrix * *
www.eeworm.com/read/399733/7839427

cpp warshall.cpp

#include using namespace std; int main() { int M[4][4]; int a = 0; int b = 0; int c = 0; int d = 0; int test; while( a != 4 ){ a = 0; cout
www.eeworm.com/read/399733/7839435

bak warshall.cpp.bak

#include < iostream > using namespace std; int main() { int M[4][4]; int a = 0; int b = 0; int c = 0; int d = 0; int test; while( a != 4 ){ a = 0; cout
www.eeworm.com/read/299457/7850957

txt id3.txt

PROTO.H NEGENTROPY negentropy ( REAL **, UINT, NODE*, UINT ); void print_tree ( NODE* , CHAR** ); void free_tree ( NODE * ); NODE* ID3 ( MATRIX * , NODE* , UINT , UINT ); void err_exit ( CHAR* ,
www.eeworm.com/read/399504/7856564

cpp stdafx.cpp

// stdafx.cpp : 只包括标准包含文件的源文件 // Matrix.pch 将成为预编译头 // stdafx.obj 将包含预编译类型信息 #include "stdafx.h"
www.eeworm.com/read/434541/7861121

h tmatrix.h

/* Ant-based Clustering Copyright (C) 2004 Julia Handl Email: Julia.Handl@gmx.de This program is free software; you can redistribute it and/or modify it under the terms of the GNU Ge