代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/124347/6051366
c ieee.c
#include
fp_rnd
_DEFUN_VOID(fpgetround)
{
char *out;
ieee_flags("get", "direction","", &out);
if (strcmp(out,"nearest") == 0) return FP_RN;
if (strcmp(out,"negative") == 0) ret
www.eeworm.com/read/343756/11929954
m zjwnnc.m
function[c ,w ,nr ] = zjwnnc (p ,t ,r)
%ZJWNNC Design radial basis network using Nearest
% Neighbor - Clusting Algorithm
%
%[C ,W ,NR] = ZJWNNC[ P ,T ,R]
% P - RxQ matrix of Q input vectors.
www.eeworm.com/read/150760/12266234
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)
% [x,fval,stat] = gnpp(H,f,options)
%
% Description:
%
www.eeworm.com/read/150760/12266265
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)
% [x,fval,stat] = gnpp(H,f,options)
%
% Description:
%
www.eeworm.com/read/128525/14292261
m tspsiman.m
function Best_tour_length= tspsiman(EUC_2D)
% A Symmetric 2D Euclidian Traveling Salesman Problem (TSP)
% Nearest Neighbor tour construction + 2-Opt local search + Simulated Annealing/Metropolis t
www.eeworm.com/read/219121/14893648
m knearestestimate.m
% k nearest neighbor estimation
function [KNearest]=KNearestEstimate(trainX,trainY,testX,k)
trainCnt=size(trainX,2); % 训练样本数量
testCnt=size(testX,2); % 测试样本数量
classLabMin=min(t
www.eeworm.com/read/213492/15133842
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)
% [x,fval,stat] = gnpp(H,f,options)
%
% Description:
%
www.eeworm.com/read/209631/15216224
m measure_newloc.m
% measure_newloc.m
%
% Acquire the new pointer location and highlight the nearest graph curve
% data point.
function measure_newloc
global meas;
sf = meas.sigfig;
% See if we've moved over new axe
www.eeworm.com/read/13887/285320
m eeg_lap_hjorth.m
function [Hjorth] = eeg_lap_hjorth(voltage,X,Y)
% EEG_LAP_HJORTH - 2D Laplacian of Potential at XY
%
% Useage: [Hjorth] = eeg_lap_hjorth(voltage [,X,Y])
%
% Notes: The Hjorth nearest neighbo
www.eeworm.com/read/15921/597521
h kdtree.h
/**@file
Functions and structures for maintaining a k-d tree database of image
features.
For more information, refer to:
Beis, J. S. and Lowe, D. G. Shape indexing using approximate
nearest-neighbo