代码搜索：Nearest

找到约 1,596 项符合「Nearest」的源代码

代码结果 1,596
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/485906/6549691

pas teenearesttooleditor.pas

{**********************************************} { TNearestToolEditor } { Copyright (c) 1999-2005 by David Berneda } {**********************************************}
·
www.eeworm.com/read/485544/6552731

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
·
www.eeworm.com/read/485392/6561135

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/480529/6665843

txt 10-10.txt

%例10-10 switch - case - otherwise - end分支语句的使用。 function lower1(method) switch method case {'linear','bilinear'} disp('Method is linear') case 'cubic'
·
www.eeworm.com/read/476396/6760185

m ch3_2_5.m

A = imread('moon.tif'); resamp = makeresampler({'nearest','cubic'},'fill'); stretch = maketform('affine',[1 0; 0 1.3; 0 0]); B = imtransform(A,stretch,resamp);
·
www.eeworm.com/read/263889/11337729

m knearest.m

function lock=Knearest(y,Y,K,p) %Syntax: lock=Knearest(y,Y,K,p) %______________________________ % % Locks the K nearest neighbors of a reference point that lie in a % phase-space. % % lock retu
·
www.eeworm.com/read/408213/11401605

m examp8_1.m

x=0:.12:1; y=(x.^2-3*x+5).*exp(-5*x).*sin(x); plot(x,y,x,y,'o') x1=0:.02:1; y0=(x1.^2-3*x1+5).*exp(-5*x1).*sin(x1); y1=interp1(x,y,x1); y2=interp1(x,y,x1,'cubic'); y3=interp1(x,y,x1,'spline'); y
·
www.eeworm.com/read/401335/11559194

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/400577/11572636

m knnc.m

%KNNC K-Nearest Neighbor Classifier % % [W,K,E] = KNNC(A,K) % [W,K,E] = KNNC(A) % % INPUT % A Dataset % K Number of the nearest neighbors (optional; default: K is % optimized with resp
·
www.eeworm.com/read/400577/11572655

m nmc.m

%NMC Nearest Mean Classifier % % W = NMC(A) % W = A*NMC % % INPUT % A Dataset % % OUTPUT % W Nearest Mean Classifier % % DESCRIPTION % Computation of the nearest mean classifier betw
·