1) zerotree set
零树集合
1.
In this paper, a efficient image coding based on new zerotree set and partition sorting strategy, called ISPIHT, is presented.
提出了一种基于简化集合定义及其分割排序的新图象编码算法 (简称为 ISPIHT) ,该算法能够通过以下措施提高 SPIHT算法工作效率 :(1)重新简化定义零树集合以提高内存空间利用率 ;(2 )改进完善集合分割排序策略以降低编码时
2.
In this paper, a new embedded zerotree wavelet image coding algorithms is presented, in which the bit allocation is changed, the zerotree set is improved and the partition-sorting strategy is revised.
该算法能够通过合理分配比特、改进零树集合、完善分类策略等措施进一步提高SPIHT算法的工作效率。
2) nullity set
零度集合
1.
The paper presents the nullity set of all bicyclic graphs of order(n(n≥6)) which is[0,n-4],and all the bicyclic graphs of order n(n≥9) with η(G)=n-4 and all the bicyclic graphs of order n(n≥ 10) with η(G)=n-5.
在此确定了所有n阶(n≥6)双圈图的零度集合是[0,n-4],并且刻画了η(G)=n-4的所有n阶(n≥9)双圈图,以及η(G)=n-5的所有n阶(n≥10)双圈图。
3) set of zero points
零点集合
4) zero area assemblage
零面积集合
1.
In the teaching of Mathematics Analysis, the concept of zero area assemblage can be extended to n-dimensional space and zero volume assemblage is set up.
在数学分析教学中，笔者把零面积集合概念推广到ｎ维空间，建立零容度的概念。
5) Merged Color Tree
联合彩色零树
6) set-enumeration tree
集合枚举树
1.
For reducing the spaces of rule database and facilitating users to query,the minimal prediction set is used and mined using maximum frequent item sets which are found by a set-enumeration tree.
利用集合枚举树找到最大频繁项目集,据此来挖掘最小预测集。
2.
The present paper presents an efficient algorithm that improves set-enumeration tree and finds maximum frequent itemsets.
提出一种快速发现最大频繁项目集的算法,该算法对集合枚举树进行改进,结合自底向上与自顶向下的搜索策略,利用非频繁项目集对候选最大频繁项目集进行剪枝和降维,减少了不必要候选最大频繁项目集的数量,显著提高了发现的效率。
补充资料：零息票债券；零券息债券
零息票债券；零券息债券一种以低于票面价值的价格发行的债务工具。债券不支付任何票息；它在到期日是以面值赎回的。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条