代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/424747/10417826
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/160583/10517149
py movie_demo.py
#!/usr/bin/env python
import os, sys
from pylab import *
files = []
figure(figsize=(5,5))
ax = subplot(111)
for i in range(50): # 50 frames
cla()
imshow(rand(5,5), interpolation='nearest')
www.eeworm.com/read/452419/6951555
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
www.eeworm.com/read/452419/6951569
c kdtree.c
/*
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-neighbor sear
www.eeworm.com/read/312163/13617616
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/147331/5731857
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/147331/5731905
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/140847/5779184
m mk_chmm.m
function bnet = mk_chmm(N, Q, Y, discrete_obs, coupled, CPD)
% MK_CHMM Make a coupled Hidden Markov Model
%
% There are N hidden nodes, each connected to itself and its two nearest neighbors in the ne
www.eeworm.com/read/133943/5897368
m mk_chmm.m
function bnet = mk_chmm(N, Q, Y, discrete_obs, coupled, CPD)
% MK_CHMM Make a coupled Hidden Markov Model
%
% There are N hidden nodes, each connected to itself and its two nearest neighbors in the ne
www.eeworm.com/read/124347/6051318
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