代码搜索:Nearest

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

代码结果 1,596
www.eeworm.com/read/253032/12249470

php functions.php

www.eeworm.com/read/223114/14656509

m mahalclassifer.m

function [ClassRate] = MahalClassifer(train_pattern, train_label, test_pattern,test_label,a) %%%%%%%%%%%%%%%%% this function is for mean nearest classifier % a for mix mahal distance % m for eachnu
www.eeworm.com/read/222632/14681926

frm main.frm

VERSION 5.00 Begin VB.Form Form1 BorderStyle = 1 'Fixed Single Caption = "K-nearest-neighbor algorithm" ClientHeight = 6630 ClientLeft = 45 ClientTop
www.eeworm.com/read/213240/15139948

m dd_ex1.m

% DD_EX1 % % Example of the creation of a One-Class problem, and the solutions % obtained by the Nearest Neighbor Data Description and the Support % Vector Data Description. Furthermore, the ROC curve
www.eeworm.com/read/13871/284589

m demknn1.m

%DEMKNN1 Demonstrate nearest neighbour classifier. % % Description % The problem consists of data in a two-dimensional space. The data is % drawn from three spherical Gaussian distributions with
www.eeworm.com/read/487231/1239320

pas make.pas

const minx = 0; maxx = 40000; miny = 0; maxy = 40000; var i,j,n:longint; begin assign(output,'Nearest.in'); rewrite(output); randomize; read(n);
www.eeworm.com/read/487231/1239322

pas make.pas

const minx = 0; maxx = 40000; miny = 0; maxy = 40000; var i,j,n:longint; begin assign(output,'Nearest.in'); rewrite(output); randomize; read(n);
www.eeworm.com/read/251838/4414543

m offline_loopy_slam.m

% We navigate a robot around a square using a fixed control policy and no noise. % We assume the robot observes the relative distance to the nearest landmark. % Everything is linear-Gaussian. %%%%%%%
www.eeworm.com/read/251522/4418880

m offline_loopy_slam.m

% We navigate a robot around a square using a fixed control policy and no noise. % We assume the robot observes the relative distance to the nearest landmark. % Everything is linear-Gaussian. %%%%%%%
www.eeworm.com/read/215485/4903505

m offline_loopy_slam.m

% We navigate a robot around a square using a fixed control policy and no noise. % We assume the robot observes the relative distance to the nearest landmark. % Everything is linear-Gaussian. %%%%%%%