代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/372266/9514683
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/372259/9515145
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/365868/9842303
m example5_1.m
I=imread('rice.tif');
imshow(I);
I1=imresize(I,1.5,'nearest neighber'); %最近邻插值
figure,imshow(I1);
I2=imresize(I,1.5,'bilibear'); %双线形插值
figure,imshow(I2);
I3=imresize(I,1.5,'bicubic'); %双三次插值
www.eeworm.com/read/365868/9842306
m example5_2.m
I=imread('eight.tif');
I1=imrotate(I,30,'bilinear','crop');
I2=imrotate(I,30,'nearest neighber');
imshow(I);
figure,imshow(I1);
figure,imshow(I2);
www.eeworm.com/read/167879/9948752
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/362596/9989398
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/163246/10168926
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/357617/10204720
txt 05-09.txt
>> x=0:0.5:10;
>> y=cos(x);
>> y1=cos(x1);
>> y2=interp1(x,y,x1,'nearest') %没有制定外插算法，估值都返回NaN
>> y2=interp1(x,y,x1,'nearest','extrap') %指明插值算法也用于外插运算
>> y3=interp1(x,y,x1,'linear','ext
www.eeworm.com/read/357125/10215862
java subsetmapper.java
package mulan.classifier;
import mulan.Statistics;
import mulan.*;
import weka.core.*;
import java.io.Serializable;
import java.util.*;
/*
* Maps a predicted set of labels to the nearest s
www.eeworm.com/read/357125/10215872
java hybridsubsetmapper.java
package mulan.classifier;
import java.util.Vector;
import mulan.LabelSet;
import weka.core.Instance;
import weka.core.Instances;
@SuppressWarnings("serial")
public class HybridSubsetMapper