最小距离

用根据相似性阈值和最小距离原则的简单聚类方法对乳腺癌和正常人血清的吸收谱进行分类识别，获得较好的分类效果。

According to similar threshold value and minimum range principle , we classify and distinguish the absorption spectra of breast cancer patients and normal people 's sera and acquire better-classified effect .

基于频域最小距离的SPOT（Pan）图像纹理分类算法

Texture Classification of SPOT ( Pan ) Image Using Minimum Distance in Frequency Space

给出了X码极大最小距离可分性质的一个证明。

Another proof of the Maximum Distance Separable property of X codes is presented .

将求解曲线间的最小距离的方法推广到曲面的情况，提出了一个基于参数域的求解两B样条曲面间的最小距离的算法及其改进的算法。

An algorithm for computing the minimum distance between two B-Spline surfaces based on the parametric domain . And an improved algorithm has been put forward .

基于最小距离均衡系数的TSP问题求解算法

An Algorithm for TSP Problem Based on Minimum Coefficient of Average Distance

基于统计模式识别的Bayes决策理论，建立了相应的识别函数和最小距离法分类器。

Correspondent recognition function and a minimum-distance classifier were constructed based on Bayes decision theory .

基于最小距离简单多边形的Delaunay三角剖分算法

Algorithm for Delaunay triangulation of simple polygon based on minimum distance

Hausdorff距离是一种比较点集的最大的最小距离。

The Hausdorff distance is a max-min distance for comparing point sets .

k调和均值算法用数据点与所有聚类中心的距离的调和平均替代了数据点与聚类中心的最小距离，是一种减小初始值影响聚类结果的有效的聚类方法。

The k-harmonic means clustering algorithm is an effective method to avoid the dependency of the performance of clustering on the initialization of the clustering centers .

应用随机过程理论，提出一种针对决策融合的高光谱遥感图像自适应最小距离和kmeans聚类的加权联合随机分类器设计方法。

Based on random theory , the weighted combination random classifier of high spectral remote sensing image has been put forward . It is composed of K-means and minimum distance classification .

在某些情况下，我们得到了该类线性码的码长n和维数k的取值以及最小距离d的下限。

We give the value of the code-length n and dimension k , and the lower bound of the minimal distances of the new linear code under some particular condition .

基于MFCC和最小距离分类器的说话人识别系统

Speaker Recognition System Based on MFCC and the Shortest-distance Classifier

TSP问题即旅行商问题，它求解旅行者经过N个城市当且仅当一次并回到原处时所走的最小距离。

TSP is short for ' travelling saleman problem ' , which is the shortest distance by travelling saleman pass by N cities and return back iff one time .

并给出了最佳的最小距离负荷比DLR值。

Figure out the value of optimal least distance - load ratio DLR .

设计了一个二级组合分类器，该分类器综合使用了最小距离和BP神经网络两种模式识别方法。

A combined classifier is designed . There are two recognition ways used in the classifier . They are the least distance pattern recognition method and the BP neural network pattern recognition method .

然后，分别采用最大似然算法和最小距离算法对研究区TM影像进行监督分类，并比较两种算法的分类效果，认为最大似然算法较为准确。

Comparing the results of supervised classification by maximum likelihood arithmetic and minimum distance arithmetic respectively , we think that the maximum likelihood arithmetic is more accurate .

两种算法中，均采用Gabor滤波器组的卷积输出作为纹理特征，并基于特征的方差设计了加权最小距离分类器。

Gabor filter banks are used to extract texture features and a weighted minimum distance classifier is designed on feature variances in both methods .

Alternant码的最小距离

The Minimum Distance of Alternant Codes

再分别采用神经网络中的多层前向网络（又称BP网络）分类器、最小距离分类器和贝叶斯决策理论分类器三种分类器对癌细胞图像进行分类识别，并对三种方法分类识别的结果进行比较。

Then use the BP neural network , the least distance arithmetic and the Bayes classifier to classify and recognize the cancer-cell images . At last , recognizing results of these three methods are compared .

处在（i，j）位置的单元格代表从源单词的i字母到目标单词的j字母的最小距离。

The cell at ( I , j ) represents the smallest distance between the first I letters of the source and the first j letters of the target .

关于Goppa码、Alternant码最小距离下限的简化算法

On the Lower Bounds on Minimum Distance for Goppa Codes and for Alternant Codes

二元Goppa码最小距离的新下限

A new lower bound for the minimum distance of binary Goppa codes

同时应用传统的监督分类方法（最小距离法和SAM法）和非监督分类方法（K-均值法和ISODATA法）进行分类。

Traditional supervised classification method ( Minimum Distance and Maximum Likelihood ) and unsupervised classification method ( K-Means and ISODATA ) were also used in this paper .

该算法采用Hamming距离分类器，通过虹膜编码的循环移位搜寻最小距离值作为最终匹配依据。

The algorithm uses the Hamming distance classifier , searching the minimum distance of iris codes as the basis for the final match after cyclic shift .

以提高图像特征点匹配算法效率为目的，研究了SIFT特征点描述子基于欧氏最小距离测度的匹配算法。

The matching algorithm of SIFT feature point descriptor based on Euclidean minimum distance is studied in order to improve the algorithm efficiency of image feature points matching .

提出了一种新的高密度多目标数据相关算法，即最小距离和MSD（MinimumSumofDistannce）算法。

A new way to solve relation of high-density multitargets-MSD ( Minimum Sum of Distance ) is presented in this paper .

几何Goppa码的最小距离

The minimum distance of Geometric Goppa codes

分圆Goppa码的最小距离

The Minimum Distance of Cyclotomic Goppa Codes

本文研究了减小干扰分布（BJ分布）时频分析方法以及奇异值特征提取方法，并对抽取的特征用最小距离分类器进行了识别。

Reduced interference distribution ( Boan-Jordan Distribution ), singular value abstraction and minimum distance classification is studied to recognize the signal .

应用了Newmark方法对导线进行了非线性分析，及应用非线性有限元动力计算方法对相邻导线靠近的最小距离进行计算。

Newmark method was applied to analyze theoretical results , and non linear finite method was applied to calculate the minimum space between two conductors in motion .