代码搜索：Matrix
找到约 10,000 项符合「Matrix」的源代码
代码结果 10,000
www.eeworm.com/read/431767/8655407
m layoutparset.m
function layoutpar=layoutparset(varargin)
%LAYOUTPARSET Link parameter configuration for WIM
% LAYOUTPAR=LAYOUTPARSET(NofMs,NofBs,SectPerBs,K) is a struct consisting
% of randomly generated ne
www.eeworm.com/read/387700/8658610
m butler.m
%This Program is Designed To Simulate The Operation Of Butler Matrix Using Hamming Window
%General Antenna Array Specifications
m = input ('The Number of Array Elements : ') ;
Msgbox ('Enter The I
www.eeworm.com/read/431675/8661765
m distmaha.m
%DISTMAHA Mahalanobis distance
%
% D = distmaha(A,U,G)
%
% Computation of the Mahanalobis distances of all vectors in the
% dataset A to a dataset of points U, using the covariance matrix G.
% G
www.eeworm.com/read/431675/8662069
m gendatc.m
%GENDATC Generation of two circular classes with different
% variances
%
% A = gendatc(na,nb,k,ma)
%
% Generation of two sets of k dimensional Gaussian distributed data
% vectors. Class a has the
www.eeworm.com/read/431675/8662125
m gendatp.m
%GENDATP Parzen density data generation
%
% B = gendatp(A,m,s)
%
% Generation of m points using the Parzen estimate of the density of
% the dataset A using a smoothing parameter s. Default s or s
www.eeworm.com/read/431659/8663409
txt prime_algorithm.m.txt
Prime算法Matlab源代码
%Prims Algorithm
clc
fid = fopen('testfile1.txt', 'r'); % Input file
%Input file should be in the form of a text file.
%5 %order of matrix
%0 2 3 4 0
%2
www.eeworm.com/read/431634/8664358
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/287843/8665291
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/287260/8699327
m mincut.m
function [flow,cutside] = mincut(sourcesink,remain)
% MINCUT Graph Max-Flow/Min-Cut.
% [FLOW,CUTSIDE] = MINCUT(SOURCESINK,REMAIN) returns a graph's maximum flow and minimum cut.
% The graph