代码搜索:Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/128468/14295332
m knnclass.m
function [class,index,dist] = knnclass(tst,X,I,K)
% [class,index,dist] = knnclass(tst,X,I,K)
%
% KNNCLASS is an implementation of K-Nearest Neighbours
% classifier. The Euclidean metric is used.
%
%
www.eeworm.com/read/228052/14401780
m odd.m
function y=odd(x);
%ODD Round towards nearest odd value.
% Y=ODD(X) rounds each element of X towards the nearest odd
% integer value. If an element of X is even, ODD adds +1 to
% this value. X can b
www.eeworm.com/read/227614/14419720
m transformimage.m
function [r,g,b] = transformImage(A,Ar,Ac,Nrho,Ntheta,Method,Center,Shape)
% Inputs: A the input image
% Nrho the desired number of rows of transformed image
% Ntheta
www.eeworm.com/read/226233/14485275
pas teenearesttooleditor.pas
{**********************************************}
{ TNearestToolEditor }
{ Copyright (c) 1999-2004 by David Berneda }
{**********************************************}
www.eeworm.com/read/124570/14558990
java relieffattributeeval.java
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either vers
www.eeworm.com/read/123833/14611610
m exp2_16.m
%curve interpolation
ys=[0 0.9 0.6 1 0 0.1 -0.3 -0.7 -0.9 -0.2]; %已有的样本点ys
xs=0:length(ys)-1; %已有的样本点xs
x=0:0.1:length(ys)-1;%新的样本点x
y1=interp1(xs,ys,x,'nearest'); %插值产生新的样本点y1
y2=interp1(xs,ys,
www.eeworm.com/read/122468/14688208
m exp2_16.m
%curve interpolation
ys=[0 0.9 0.6 1 0 0.1 -0.3 -0.7 -0.9 -0.2]; %已有的样本点ys
xs=0:length(ys)-1; %已有的样本点xs
x=0:0.1:length(ys)-1;%新的样本点x
y1=interp1(xs,ys,x,'nearest'); %插值产生新的样本点y1
y2=interp1(xs,ys,
www.eeworm.com/read/220803/14788501
m exp2_16.m
%curve interpolation
ys=[0 0.9 0.6 1 0 0.1 -0.3 -0.7 -0.9 -0.2]; %已有的样本点ys
xs=0:length(ys)-1; %已有的样本点xs
x=0:0.1:length(ys)-1;%新的样本点x
y1=interp1(xs,ys,x,'nearest'); %插值产生新的样本点y1
y2=interp1(xs,ys,
www.eeworm.com/read/119076/14841043
pas teenearesttooleditor.pas
{**********************************************}
{ TNearestToolEditor }
{ Copyright (c) 1999-2004 by David Berneda }
{**********************************************}
www.eeworm.com/read/220289/14843820
m knnfwd.m
function [y, l] = knnfwd(net, x)
%KNNFWD Forward propagation through a K-nearest-neighbour classifier.
%
% Description
% [Y, L] = KNNFWD(NET, X) takes a matrix X of input vectors (one vector
% per ro