代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/367675/2833134
txt 58.txt
发信人: patrickli (打死也不说), 信区: DataMining
标 题: 一些源代码的地址! 关于SVM的
发信站: 南京大学小百合站 (Wed Apr 16 13:40:51 2003)
Nearest Point Algorithm. by Sathiya Keerthi (in FORTRAN).
http://guppy.mpe.nus.edu.sg/~mpe
www.eeworm.com/read/292045/8380537
m pre_bylay.m
%多步预测(不回带数据)
tau=1;
m=2;
P=2;
lmd=.5948;
prestep=1;%预测步数要小于tau
newdata=data(1:length(data)-prestep);
[idx,min_d,idx1,min_d1]=nearest_point(m,newdata,length(newdata),P);
[x_1,x_2]=pre_by_lya1
www.eeworm.com/read/376899/9301713
m cha2_3_1.m
I=imread('standard_lena.bmp');
I2=imresize(I,0.125);
Z1=interp2(double(I2),2,'nearest');
Z1=uint8(Z1);
figure(1);
imshow(I);
figure(2);
imshow(Z1);
imwrite(Z1,'cha2_3_1_1.bmp','bmp');
Z2=inte
www.eeworm.com/read/161509/10400032
m pre_bylay.m
%多步预测(不回带数据)
tau=1;
m=2;
P=2;
lmd=.5948;
prestep=1;%预测步数要小于tau
newdata=data(1:length(data)-prestep);
[idx,min_d,idx1,min_d1]=nearest_point(m,newdata,length(newdata),P);
[x_1,x_2]=pre_by_lya1
www.eeworm.com/read/307450/13722113
m pre_bylay.m
%多步预测(不回带数据)
tau=1;
m=2;
P=2;
lmd=.5948;
prestep=1;%预测步数要小于tau
newdata=data(1:length(data)-prestep);
[idx,min_d,idx1,min_d1]=nearest_point(m,newdata,length(newdata),P);
[x_1,x_2]=pre_by_lya1
www.eeworm.com/read/486829/6530435
m pre_bylay.m
%多步预测(不回带数据)
tau=1;
m=2;
P=2;
lmd=.5948;
prestep=1;%预测步数要小于tau
newdata=data(1:length(data)-prestep);
[idx,min_d,idx1,min_d1]=nearest_point(m,newdata,length(newdata),P);
[x_1,x_2]=pre_by_lya1
www.eeworm.com/read/424063/10499934
m perpxy.m
function [x4,y4] = perpxy(x1,y1,x2,y2,x3,y3)
% PERPXY Finds a point [xp,yp] which is the nearest point from
% [x3,y3] on the straight line formed between [x1,x2] and
% [x2,y2].
%
% [xp,yp]=perpxy
www.eeworm.com/read/405068/11472336
m s4_5_q9.m
function nearest_classify
% 画出数据点的位置
clear all;close all;clc;
w1=[10,0;0,-10;5,-2];
w2=[5,10;0,5;5,5];
w3=[2,8;-5,2;10,-4];
region=[-12 12 -12 12 100];
subplot(221);
patterns=[w1;w2]';
D=
www.eeworm.com/read/147096/12584049
m perpxy.m
function [x4,y4] = perpxy(x1,y1,x2,y2,x3,y3)
% PERPXY Finds a point [xp,yp] which is the nearest point from
% [x3,y3] on the straight line formed between [x1,x2] and
% [x2,y2].
%
% [xp,yp]=perpxy
www.eeworm.com/read/101557/15826542
m perpxy.m
function [x4,y4] = perpxy(x1,y1,x2,y2,x3,y3)
% PERPXY Finds a point [xp,yp] which is the nearest point from
% [x3,y3] on the straight line formed between [x1,x2] and
% [x2,y2].
%
% [xp,yp]=perpxy