助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   约束最大 在 计算机软件及计算机应用 分类中 的翻译结果: 查询用时:0.76秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

约束最大
相关语句
  constrained maximum
    In this paper, a new incremental updating algorithm IUCMFIA is presented for efficient maintenance of discovered constrained maximum frequent itemsets when new transaction data is added to a transaction database.
    发现约束频繁(约束最大频繁)项目集是多种数据挖掘应用中的关键问题,目前已有许多算法可用于发现约束频繁(约束最大频繁)项目集,而对约束频繁(约束最大频繁)项目集维护问题的研究工作却很少,因此,需要设计高效的算法来更新、维护和管理已挖掘出来的约束频繁(约束最大频繁)项目集。
短句来源
    Incremental Updating Algorithm for Mining Constrained Maximum Frequent Itemsets
    约束最大频繁项目集的增量式更新算法
短句来源
    An Algorithm and Its Updating Algorithm Based on Frequent Pattern Tree for Mining Constrained Maximum Frequent Itemsets
    一种基于频繁模式树的约束最大频繁项目集挖掘及其更新算法
短句来源
    Algorithm for Mining Constrained Maximum Frequent Itemsets Based on Frequent Pattern Tree
    基于频繁模式树的约束最大频繁项目集挖掘算法研究
短句来源
    The algorithm IUCMFIA will make use of previous mining result to cut down the cost of finding new constrained maximum frequent itemsets in an updated database, and the execution of algorithm IUCMFIA is illustrated.
    为此,该文提出了一种快速的增量式更新约束最大频繁项目集算法IUACMFI,并举例说明了算法的执行过程。
短句来源
更多       
  “约束最大”译为未确定词的双语例句
    Maximum a Posteriori Restoration with Markov Constraint for Three-Dimensional Optical-Sectioning Microscopy
    基于马尔科夫约束最大后验概率三维显微图像复原算法
短句来源
查询“约束最大”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  constrained maximum
The method consists of introducing a function, called potential, which at an unconditional maximum converges to the constrained maximum when a positive parameter of the potential tends to zero.
      
The method consists of approximating a constrained maximum by unconstrained maxima of a potential function.
      
There was no indication that ventilation constrained maximum O2 consumption rate.
      
Inequality constrained maximum likelihood estimation
      
On constrained maximum likelihood estimation with non-i.i.d.
      
更多          


arametric design is the core of the current CAD technology. The way tomanage the constraints conveniently and efficiently is required by the procedures to modeland solve the geometric constraint system which is the base of parametric design. A newmethod called as MRA(maximal reduction algorithm) is presented in this paper. It owesto the application about analysis of degree of freedom, graph theory and sparse matrix theory. The MRA is very effective for geometric constraint consistency checking, maximaldecomposition...

arametric design is the core of the current CAD technology. The way tomanage the constraints conveniently and efficiently is required by the procedures to modeland solve the geometric constraint system which is the base of parametric design. A newmethod called as MRA(maximal reduction algorithm) is presented in this paper. It owesto the application about analysis of degree of freedom, graph theory and sparse matrix theory. The MRA is very effective for geometric constraint consistency checking, maximaldecomposition of geometric constraint system and constraint management. It is worth thatthe MRA express the serial, parallel and coupling mechanism of constraint propagationwith reducing tree.

参数化设计技术是当代CAD技术的核心.作为该技术基础的几何约束系统的建模与求解,要求对约束进行方便、有效的管理.为此,本文基于自由度分析、图论、稀疏矩阵及非线性方程等理论,提出了几何约束最大归约理论,实现了几何约束系统的最大分解,并以归约树的形式清晰地表达了系统内在的串、并、耦合机制,并成功地应用于参数化绘图系统中至关重要的约束一致性检查、快速求解等约束管理问题

: A constrained Delaunay triangulation cutting algorithm is proposed for computing the triangulated irrgular network of a set of irregularly located planar points.The algorithm is designed to create a constrained maximum empty-circle convex polygon network firstly,then constrained Delaunay triangulation inside these polygons is followed.It is demonstrated in this paper that the constrained maximum empty-circle convex polygon network of a set of planar points is unique,and the ambiguty of constrained Delaunay...

: A constrained Delaunay triangulation cutting algorithm is proposed for computing the triangulated irrgular network of a set of irregularly located planar points.The algorithm is designed to create a constrained maximum empty-circle convex polygon network firstly,then constrained Delaunay triangulation inside these polygons is followed.It is demonstrated in this paper that the constrained maximum empty-circle convex polygon network of a set of planar points is unique,and the ambiguty of constrained Delaunay triangulation exists only in the inside of the polygons.The introduction of constrained maximum empty-circle convex polygon successfully solves the degeneracy problem.

文章提出了一种基于切割的平面散乱点集约束Delaunay三角剖分算法。该算法的基本思路是首先对平面散乱点集作约束最大空圆凸多边形剖分,然后对多边形的内部再作约束Delaunay三角形剖分。文章还证明了平面散乱点集的约束最大空圆凸多边形剖分是唯一的以及约束Delaunay三角剖分的不唯一性仅仅体现在约束最大空圆凸多边形的内部。使用约束最大空圆凸多边形的概念消除了由于“退化”现象(三个以上的点共圆)带来的算法上的潜在错误。

Constrained surface and constrained maximum empty-sphere convex polyhedron are introduced to compute triangulation in spatial regions.The region enclosed by a constrained surface is divided into some of constrained maximum empty-sphere convex polyhedrons,the triangulation is followed inside these polyhedrons.Using the method of triangulation in spatial regions,the algorithm of reconstruction of three-dimensional surface is proposed in this paper.

该文提出了约束曲面和约束最大空球凸多面体的概念,在此基础上设计了一种在空间区域上做约束Delaunay四面体剖分的算法。该算法的基本思路是首先对空间区域进行约束最大空球凸多面体剖分,然后在各个约束最大空球凸多面体内部做Delaunay四面体剖分。利用约束Delaunay四面体剖分算法,该文进一步设计了一种三维物体表面重建算法。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关约束最大的内容
在知识搜索中查有关约束最大的内容
在数字搜索中查有关约束最大的内容
在概念知识元中查有关约束最大的内容
在学术趋势中查有关约束最大的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社