代码搜索：Nearest

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

代码结果 1,596
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/303048/13823280

m knn.m

function [C,P]=knn(d, Cp, K) %KNN K-Nearest Neighbor classifier using an arbitrary distance matrix % % [C,P]=knn(d, Cp, [K]) % % Input and output arguments ([]'s are optional): % d (matrix)
·
www.eeworm.com/read/147331/5731169

c dl-addr.c

/* Locate the shared object symbol nearest a given address. Copyright (C) 1996-2000, 2001 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free sof
·
www.eeworm.com/read/124910/6036046

c s_rintf.c

/* Round a 32-bit floating point value to the nearest integer. Copyright (C) 1997, 2000 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free softw
·
www.eeworm.com/read/124910/6036054

c s_rint.c

/* Round a 64-bit floating point value to the nearest integer. Copyright (C) 1997, 2000 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free softw
·
www.eeworm.com/read/479088/6699325

m euclide.m

function [s,V] = euclide(z,rho,theta) % function EUCLIDE.M % Nearest neighbor approximation algorithm % % Usage: [s,V] = euclide(z,rho,theta) % Where: z = M by N matrix with samples in frequency dom
·
www.eeworm.com/read/405069/11472268

m store_grabbag.m

function test_targets = Store_Grabbag(train_patterns, train_targets, test_patterns, Knn) % Classify using the store-grabbag algorithm (an improvement on the nearest neighbor) % Inputs: % train_p
·
www.eeworm.com/read/346528/11739395

m spnnchain.m

% spnnchain Defines a Hamiltonian with a(k)b(k+1) nearest-neighbor % interaction; sparse version. % spnnchain (a,b,n) defines a a(k)b(k+1) type Hamiltonian % with non-periodic bou
·
www.eeworm.com/read/250958/12373888

java algorithmnn.java

/** * AlgorithmNN.java v6.0 03/15/2005 * * Author Phil Trasatti, Last edited Sanjay Created: 7/15/03 * * Nearest Neighbor algorithm. Determines the line of * discrimination between data sets b
·
www.eeworm.com/read/128525/14292260

m tourdist.m

function tour_distance = tourdist(tourvec, distance_matrix); % This function is used with Tspsiman.m. % 2D Euclidian Traveling Salesman Problem (TSP) % Nearest Neighbor tour construction + 2-Opt lo
·
www.eeworm.com/read/218613/14912904

m spnnchain.m

% spnnchain Defines a Hamiltonian with a(k)b(k+1) nearest-neighbor % interaction; sparse version. % spnnchain (a,b,n) defines a a(k)b(k+1) type Hamiltonian % with non-periodic bou
·