代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/298657/3861007
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/293584/3929447
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/293584/3929484
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/292984/3935812
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/292964/3936960
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/279968/4130050
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/279968/4130098
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/273763/4193224
h pixops.h
#ifndef PIXOPS_H
#define PIXOPS_H
#include
/* Interpolation modes; must match GdkInterpType */
typedef enum {
PIXOPS_INTERP_NEAREST,
PIXOPS_INTERP_TILES,
PIXOPS_INTERP_BILINEAR,
PIX
www.eeworm.com/read/434858/1867985
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/393163/2487907
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