1) regularized MVEE cognize model
规则化最小体积覆盖椭球
2) rule coverage
规则覆盖
1.
Context-dependent rule coverage is proposed recently,which produces different branch sets according to the structures of different grammars,and is more precise than rule coverage.
基于规则覆盖的句子生成,是上下文无关文法句子生成的主要方法,但是它也具有局限性。
3) minimum coverage
最小覆盖
1.
There is a NP-hard problem that derive the minimum coverage of multi-output logic circuit in two-level logic synthesis.
两级逻辑综合中的多输出逻辑电路最小覆盖的求解是一个NP难解问题,在输出变量集合和质蕴含项集合规模较大的情况下,会出现空间需求过大、处理时间太长等问题,影响多输出最小覆盖求解的可行性。
2.
A minimum coverage method called CWSCM is presented to deal with complicated Web service composition.
针对复杂Web服务的组合问题,提出了基于最小覆盖的Web服务组合方法(CWSCM)。
3.
A new classifying discrimination method different from the previous ones was put forward based on the principle of minimum coverage.
提出了通过最小覆盖的原理来进行样本分类判别的一种新方法;给出了空间中的样本分类判别准则和分类模型。
4) minimal cover
最小覆盖
1.
Design of City Environmental Information System Database and Its Minimal Cover;
城市环境信息系统数据库设计及最小覆盖算法
2.
Based on this, th e sufficient and necessary condition under which a set of GD-Constrai nts is a minimal cover is given.
在此基础上，给出了一个GD-约束集成为最小覆盖的充要条件。
3.
This paper introduces a fast and effective logic syntheses arithmetic, to find the minimal cover of multi-input multi-output function with a method of expand cube.
本文通过对现有算法的深入研究,介绍一种快速有效的逻辑综合算法,即立方扩展法直接求出多输入多输出函数的最小覆盖,用Delphi6。
5) minimum cover
最小覆盖
1.
The research of the algorithm of the minimum cover for XML;
基于XML最小覆盖算法的研究
2.
Based on these theorems,gives the minimum cover algorith m of the multivalued dependency based on the MVD schema matrix.
根据这些定理，给出了基于ＭＶＤ模式矩阵的多值依赖最小覆盖算法。
3.
The algorithm to find the minimum coverof MVD based on the inverse hypergraph of MVD is given also.
证明了若干个逆向ＭＶＤ超图的化简定理，最后给出了基于逆向ＭＶＤ超图的求ＭＶＤ最小覆盖算法。
6) minimal covering
最小覆盖
1.
Some results on decision for minimal covering of regular separable function sets in partial K-valued logic;
关于部分K值逻辑中正则可离函数集的极大封闭集之最小覆盖判定的一些结果
2.
The decision on not belonging to the minimal covering members of function sets preserving ternary regularly separable relations in partial Four-Valued Logic;
P_4~*中保三元正则可离关系函数集非最小覆盖成员的确定
3.
Some results on decision for minimal covering in partial K-valued logic;
部分K值逻辑中最小覆盖之判定的一些结果
补充资料：参考椭球(见地球椭球)
参考椭球(见地球椭球)
reference ellipsoid
eankao tU0qlu参考椭球(referenee ellipsoid)见地沐椭球
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条