1) minimal subset
最小子集
1.
A quadric surface was defined uniquely by a minimal subset, and the extracting of quadric surfaces was considered as the equivalent to finding the optimum value of a cost function, then solving this problem by Tabu search.
使用最小子集定义一个二次曲面 ,将二次曲面的提取等同于寻找目标函数的优化值 ,并使用Tabu搜索算法最终将规则曲面从测量数据中分离出来。
2.
A genetic algorithm based on minimal subset representation to perform primitive extraction is presented.
为此提出了一种基于最小子集的遗传算法来提取基元 ,在此 ,最小子集被定义为确定某一基元所需几何点的最小数目 。
3.
With this method,all minimal subset can be resolved and the computational complexity is less than solution from definition.
利用该方法能准确地求出信息系统中所有的最小子集,且计算量少于由定义来约简。
2) Minimal element subdivision
最小子集法
3) minimal sub-model set(MSMS)
最小子模型集
4) redundant minimal subset
最小冗余子集
1.
Based on the new idea of randomly sampling the redundant minimal subset,a new method is developed of robustly and accurately restoring the 3-D vision information of an object from the model data and image data of its key point set of a single perspective view.
基于随机采样最小冗余子集的新概念，依据单视图特征点集的模型数据和图象数据，开发了一项目标三维视觉信息鲁棒精确复原新方法在强噪声高出格率的恶劣条件下，该方法仍可高精度地复原目标的三维信息实验表明，对于由１００个特征点组成的数据集而言，当出格率高达９０％，内点信噪比低达２８ｄＢ时，仍能以１％的相对误差复原特征点的三维坐标
5) Minimum atom aggregation
最小原子汇集
6) minimal authorized subset
最小合格子集
1.
Even if a participant is contained in many minimal authorized subsets he needs not to keep more than one secret shares for sharing one secret.
对要分享的一个秘密 ,不管一个参与者属于多少个最小合格子集 ,他只需保存一个秘密份额 。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条