代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/367152/9780179
m lans_proj2tri.m
% lans_proj2tri - Project data onto a triangular patch in high-D space
%
% [se,np,idx] = lans_proj2tri(y,tri,tridx)
%
% _____OUTPUTS____________________________________________________________
%
www.eeworm.com/read/415311/11077068
m interactive_learning.m
function D = Interactive_Learning(train_features, train_targets, params, region);
% Classify using nearest neighbors and interactive learning
% Inputs:
% features- Train features
% targets - Tr
www.eeworm.com/read/411674/11233762
m knnrule.m
function model=knnrule(data,K)
% KNNRULE Creates K-nearest neighbours classifier.
%
% Synopsis:
% model=knnrule(data)
% model=knnrule(data,K)
%
% Description:
% It creates model of the K-nearest ne
www.eeworm.com/read/133707/14029437
lnt co-arch.lnt
// co-arch.lnt
// Compiler Options for Archimedes C
// This file contains options to allow PC-lint to process source
// files for your compiler. It is used as follows:
//
//
www.eeworm.com/read/444082/7618743
pdf improving the performance of multi-class svms in face recognition with nearest neighbor rule.pdf
www.eeworm.com/read/282594/9081238
m data_associate.m
function [zf,idf, zn]= data_associate(x,P,z,R, gate1, gate2)
%
% Simple gated nearest-neighbour data-association. No clever feature
% caching tricks to speed up association, so computation is O(N)
www.eeworm.com/read/373627/9446110
index
SOM Self-Organizing Maps: Online Algorithm
batchSOM Self-Organizing Maps: Batch Algorithm
condense Condense training set for k-NN classifier
knn
www.eeworm.com/read/165898/10047297
m sumarize11_3_2.m
load woman2
subplot(2,2,1)
imshow(X,map)
X1 = imresize(X,2,'nearest');
subplot(2,2,2)
imshow(X1,[]);
X2 = imresize(X,2,'bilinear');
subplot(2,2,3)
imshow(X2,[]);
X3 = imresize(X,2,'bicubic');
www.eeworm.com/read/165161/10073843
m data_associate.m
function [zf,idf, zn]= data_associate(x,P,z,R, gate1, gate2)
%
% Simple gated nearest-neighbour data-association. No clever feature
% caching tricks to speed up association, so computation is O(N)
www.eeworm.com/read/279384/10442413
c ortho_distance.c
/*
* Copyright (c) 2005 by the Society of Exploration Geophysicists.
* For more information, go to http://software.seg.org/2005/0001 .
* You must read and accept usage terms at:
* http://software.