代码搜索:Nearest

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

代码结果 1,596
www.eeworm.com/read/373632/9445438

html knntree.html

R: K-NEAREST NEIGHBOR CLASSIFIERS WITHIN LEAVES OF A TREE
www.eeworm.com/read/373627/9446134

html knn.cv.html

R: k-Nearest Neighbour Cross-Validatory Classification
www.eeworm.com/read/469416/6976481

m knn.m

function net = knn(nin, nout, k, tr_in, tr_targets) %KNN Creates a K-nearest-neighbour classifier. % % Description % NET = KNN(NIN, NOUT, K, TR_IN, TR_TARGETS) creates a KNN model NET % with inpu
www.eeworm.com/read/140851/13059312

m knn.m

function net = knn(nin, nout, k, tr_in, tr_targets) %KNN Creates a K-nearest-neighbour classifier. % % Description % NET = KNN(NIN, NOUT, K, TR_IN, TR_TARGETS) creates a KNN model NET % with inpu
www.eeworm.com/read/138798/13212390

m knn.m

function net = knn(nin, nout, k, tr_in, tr_targets) %KNN Creates a K-nearest-neighbour classifier. % % Description % NET = KNN(NIN, NOUT, K, TR_IN, TR_TARGETS) creates a KNN model NET % with inpu
www.eeworm.com/read/101082/6247389

3m floor.3m

.\" SCCSID: @(#)floor.3m 8.1 9/11/90 .TH floor 3m VAX .SH Name fabs, floor, ceil, fmod, rint \- absolute value, floor, ceiling, floating point remainder, and round-to-nearest functions .SH Syntax .
www.eeworm.com/read/336465/12442201

nlogo !!!---wolfmoose.nlogo

breeds [wolves moose] wolves-own [packmates nearest-wolf] globals [surrounded steps patches-colored] to setup ca set patches-colored false set-default-shape wolves "wolf-face" set-default-sh
www.eeworm.com/read/13871/284663

m knn.m

function net = knn(nin, nout, k, tr_in, tr_targets) %KNN Creates a K-nearest-neighbour classifier. % % Description % NET = KNN(NIN, NOUT, K, TR_IN, TR_TARGETS) creates a KNN model NET % with inpu
www.eeworm.com/read/13887/285284

m elec_distance_consec.m

function [C_e, C_d] = elec_distance_consec(dist_e, dist_d) % ELEC_DISTANCE_CONSEC - Identify distance between nearest neighbour electrodes % % Requires input data generated by 'elec_distance.m'
www.eeworm.com/read/216502/4891378

c move.c

# include "e.h" # include "e.def" move(dir, amt, p) int dir, amt, p; { int a; yyval = p; a = VERT( (amt+49)/50 ); /* nearest number of half-lines */ printf(".ds %d ", yyval); if( dir == FWD ||