代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/311722/3678148
m log_rnd.m
function x = log_rnd(x,rnd)
%LOG_RND Rigorous bounds for log(x) according to round
%
% y = log_rnd(x)
%
%Rounding needs not be to nearest after execution
%
% written 12/30/98 S.M.
www.eeworm.com/read/447738/1698615
s bwtest-err-1.s
; File bwtest-err-1.s
; { dg-do assemble { target cris-*-* } }
; A variant of exbwtest.s. This is an example of invalid use of the broken-
; dot-word function. The nearest label occurs about 32 k
www.eeworm.com/read/395929/2429965
s bwtest-err-1.s
; File bwtest-err-1.s
; { dg-do assemble { target cris-*-* } }
; A variant of exbwtest.s. This is an example of invalid use of the broken-
; dot-word function. The nearest label occurs about 32 k
www.eeworm.com/read/378175/2689740
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/367675/2832684
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/367675/2836580
txt 999.txt
发信人: strawman (独上江楼思渺然), 信区: DataMining
标 题: Re: 请教有关于k-<mark>nearest</mark> neighbor的问题？？？
发信站: 南京大学小百合站 (Wed Sep 18 11:14:21 2002), 站内信件
我没有做过k-<mark>nearest</mark> neighbor方面的工作。我想你可以检查一下你的程序是否有问题，
另外，就是你用于训练和测试的数据是否 ...
www.eeworm.com/read/428849/8835028
m gnpp.m
function [x,fval,stat] = gnpp(H,f,y,options)
% GNPP Solves Generalized Nearest Point (GNPP) problem.
%
% Synopsis:
% [x,fval,stat] = gnpp(H,f,y)
% [x,fval,stat] = gnpp(H,f,y,options)
%
% Descriptio
www.eeworm.com/read/200000/7813749
m kda_qr.m
function [mean_accuracy, mean_time] = KDA_QR(dataX, dataY, k, rbf_var, F, reg)
% dataX: data matrix stored in row-wise format
% dataY: class label
% k: number of nearest neighbors in KNN
%
www.eeworm.com/read/312163/13617639
m gnpp.m
function [x,fval,stat] = gnpp(H,f,y,options)
% GNPP Solves Generalized Nearest Point (GNPP) problem.
%
% Synopsis:
% [x,fval,stat] = gnpp(H,f,y)
% [x,fval,stat] = gnpp(H,f,y,options)
%
% Descriptio
www.eeworm.com/read/213492/15133856
m gnpp.m
function [x,fval,stat] = gnpp(H,f,y,options)
% GNPP Solves Generalized Nearest Point (GNPP) problem.
%
% Synopsis:
% [x,fval,stat] = gnpp(H,f,y)
% [x,fval,stat] = gnpp(H,f,y,options)
%
% Descriptio