代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/484096/1271959
changelog
2005-02-11 Brian Gough
* fp-gnuc99.c (gsl_ieee_set_mode): added an #ifdef for the default
round to nearest mode
2003-12-20 Brian Gough
*
www.eeworm.com/read/455463/1614066
m near.m
function L=near(v,val1,val2)
% NEAR: return indices of those samples in a vector nearest given bounds
%
% L=near(v,val1,val2)
% L=near(v,val1)
%
% NEAR searches the vector v and finds the index,
www.eeworm.com/read/193974/5138517
test_scope
test_scope
1. simple nesting
2. extra nesting
3. simple nesting + rebinding
4. nesting with global but no free
5. nesting through class
6. nesting plus free ref to global
7. nearest enclosing scope
8.
www.eeworm.com/read/396844/2407743
m knn_old.m
function [Class,P]=knn_old(Data, Proto, proto_class, K)
%KNN_OLD A K-nearest neighbor classifier using Euclidean distance
%
% [Class,P]=knn_old(Data, Proto, proto_class, K)
%
% [sM_class,P]=knn_old
www.eeworm.com/read/194440/8193258
m near.m
function L=near(v,val1,val2)
% NEAR: return indices of those samples in a vector nearest given bounds
%
% L=near(v,val1,val2)
% L=near(v,val1)
%
% NEAR searches the vector v and finds the index,
www.eeworm.com/read/294611/8216514
m knn_old.m
function [Class,P]=knn_old(Data, Proto, proto_class, K)
%KNN_OLD A K-nearest neighbor classifier using Euclidean distance
%
% [Class,P]=knn_old(Data, Proto, proto_class, K)
%
% [sM_class,P]=knn_old
www.eeworm.com/read/367875/9724810
m knn_old.m
function [Class,P]=knn_old(Data, Proto, proto_class, K)
%KNN_OLD A K-nearest neighbor classifier using Euclidean distance
%
% [Class,P]=knn_old(Data, Proto, proto_class, K)
%
% [sM_class,P]=knn_old
www.eeworm.com/read/235928/14041387
m knn_old.m
function [Class,P]=knn_old(Data, Proto, proto_class, K)
%KNN_OLD A K-nearest neighbor classifier using Euclidean distance
%
% [Class,P]=knn_old(Data, Proto, proto_class, K)
%
% [sM_class,P]=knn_old
www.eeworm.com/read/235612/14060352
m near.m
function L=near(v,val1,val2)
% NEAR: return indices of those samples in a vector nearest given bounds
%
% L=near(v,val1,val2)
% L=near(v,val1)
%
% NEAR searches the vector v and finds the index,
www.eeworm.com/read/188503/8535151
h yuvscaler.h
// yuvscaler.c
void yuvscaler_print_usage (char *argv[]);
void yuvscaler_print_information (y4m_stream_info_t in_streaminfo, y4m_ratio_t frame_rate);
uint8_t yuvscaler_nearest_integer_division (unsign