代码搜索:Matrix

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

代码结果 10,000
www.eeworm.com/read/162188/10328447

src median.src

/* ** median.src - medians of columns of a matrix ** (C) Copyright 1988-1998 by Aptech Systems, Inc. ** All Rights Reserved. ** ** This Software Product is PROPRIETARY SOURCE CODE OF APTECH ** S
www.eeworm.com/read/162075/10341941

m netgrad.m

function g = netgrad(w, net, x, t) %NETGRAD Evaluate network error gradient for generic optimizers % % Description % % G = NETGRAD(W, NET, X, T) takes a weight vector W and a network data % structure
www.eeworm.com/read/354578/10344858

m appcoars.m

function [m,Fc,Fa,C,N,N0]=appcoars(m,F,K,version); % Copyright Thierry Denoeux % April 4, 2002 % % Inner and outer coarsening approximation of a single basic belief assignment % % [m,Fc,Fa
www.eeworm.com/read/425546/10348994

m netgrad.m

function g = netgrad(w, net, x, t) %NETGRAD Evaluate network error gradient for generic optimizers % % Description % % G = NETGRAD(W, NET, X, T) takes a weight vector W and a network data % stru
www.eeworm.com/read/425546/10349180

m mlphess.m

function [h, hdata] = mlphess(net, x, t, hdata) %MLPHESS Evaluate the Hessian matrix for a multi-layer perceptron network. % % Description % H = MLPHESS(NET, X, T) takes an MLP network data struct
www.eeworm.com/read/161855/10360990

risk toy.risk

categories { one, two, three } prior { 2, 1, 1 } loss_matrix { "" one [ 0, 1, 2 ] "" two [ 3, 0, 5 ] "" three [ 1, 1, 0 ] }
www.eeworm.com/read/161829/10367170

m demo.m

% This code is just a front-end to source separation algorithms. % Purpose: % 1) generate synthetic data % 2) call some source separation algorithm % 3) display the results % The data are CM (constant
www.eeworm.com/read/161731/10382382

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
www.eeworm.com/read/161587/10394769

out allpairs.out

Enter number of edges of 5 vertex weighted digraph enter edge 1 enter edge 2 enter edge 3 enter edge 4 enter edge 5 enter edge 6 enter edge 7 The weighted digraph is 0 4 2 0 8 0 0 0 4 5 0
www.eeworm.com/read/161587/10395076

cpp smatrix.cpp

// test formula based sparse matrix class #include #include "smatrix.h" void main(void) { SparseMatrix A(20), B(20), C(20); cin >> A; cout