代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/139007/13195594
m symmpart.m
function S = symmpart(A)
%SYMMPART Symmetric (Hermitian) part.
% SYMMPART(A) is the symmetric (Hermitian) part of A, (A + A')/2.
% It is the nearest symmetric (Hermitian) matrix
www.eeworm.com/read/137160/13341895
m nmc.m
%NMC Nearest Mean Classifier
%
% W = NMC(A)
%
% INPUT
% A Dataset
%
% OUTPUT
% W Nearest Mean Classifier
%
% DESCRIPTION
% Computation of the nearest mean classifier between the classe
www.eeworm.com/read/137160/13342252
m nmsc.m
%NMSC Nearest Mean Scaled Classifier
%
% W = NMSC(A)
%
% INPUT
% A Trainign dataset
%
% OUTPUT
% W Nearest Mean Scaled Classifier mapping
%
% DESCRIPTION
% Computation of the linear discrim
www.eeworm.com/read/321771/13399505
m regroutl.m
function [W] = RegrOutl(X,W)
% [W] = RegrOutl(X,W)
% [W] = RegrOutl(X)
%
% Function eliminates outliers interactively.
% Feedback is given on the graphical screen -
% mouse clicks toggle
www.eeworm.com/read/314681/13561805
m fnn_mex2.m
function tnnmat=fnn_mex2(xcoord, ycoord, ms, n, istart)
%
%tnnmat=fnn_mex2(xcoord, ycoord, ms, n, istart)
%
%This function computes m spatiotemporal nearest neighbors for each observation from obs
www.eeworm.com/read/314653/13562255
m nmc.m
%NMC Nearest Mean Classifier
%
% W = NMC(A)
%
% INPUT
% A Dataset
%
% OUTPUT
% W Nearest Mean Classifier
%
% DESCRIPTION
% Computation of the nearest mean classifier between the classe
www.eeworm.com/read/314653/13562510
m nmsc.m
%NMSC Nearest Mean Scaled Classifier
%
% W = NMSC(A)
%
% INPUT
% A Trainign dataset
%
% OUTPUT
% W Nearest Mean Scaled Classifier mapping
%
% DESCRIPTION
% Computation of the linear discrim
www.eeworm.com/read/306748/13738947
c round.c
/* round.c
*
* Round double to nearest or even integer valued double
*
*
*
* SYNOPSIS:
*
* double x, y, round();
*
* y = round(x);
*
*
*
* DESCRIPTION:
*
* Returns the nearest in
www.eeworm.com/read/304650/13790281
m fs01.m
function Xt_plus_1=fs01(Xt,w);
%The local linear approximation method of the first order to predict a chaotic time series, after Farmer and Sidorowich,1987
%modified with help of constrained linea
www.eeworm.com/read/150221/5694175
m brute.m
function [indices, distances] = brute(points, refind, nnr, past)
% [indices, distances] = brute(points, refind, nnr, past)
%
% Brute force implementation of nearest neighbor search
%
% Input argument