Based on the former fact, we introduce the arithmetic coding algorithm based on binary index tree.
基于上述事实，本文引入了基于二进索引树的算术编码算法。
In the data broadcast, the visits probability of the data record is various, therefore the index tree may be built through visit probability.
在数据广播中，数据记录被访问的概率各不相同，因此可以通过访问概率建立索引树。
In order to solve these problems, this paper proposes a transformation algorithm of abstract information based on the semantic path, in the light of constructed XML index tree.
针对现有的XML签名对特定细粒度信息查找困难和签名速度慢的问题，提出一种基于语义路径提取信息的变换算法，此语义路径通过构建XML索引结构得到。
The principles and requirements of establishing the assessment index system of fuze design for producibility are advanced. An assessment index tree of fuze DFP is given and analyzed in detail.
提出了引信DF P评价指标体系建立的原则和要求，给出了引信DF P评价指标树，并较详细地对其进行了分析。
Due to the data access skew, index technology based on data access probability is proposed. At last ord algorithm is proposed to create optimal broadcast sequence according to given index tree.
针对数据库中数据访问的倾斜性，文章提出建立基于数据访问概率的索引技术，并给出了ORD算法，它可以根据给定的索引树创建最优的广播序列。
This paper introduces a newly generalized and dynamic structure for the similarity retrieval of high dimensional feature vectors called the recursive clustering index tree.
文章提出了一种新的适用于高维特征矢量相似检索动态聚类索引树结构。
The structure of the index tree decides the average index number to be visited, but even regarding the same index structure, the average visit time is different if the broadcast sequence is different.
索引树的结构决定了平均访问索引节点的数目，但是即使对于相同的索引结构，如果采用不同的广播序列，则平均访问时间也不尽相同。
The structure of the index tree decides the average index number to be visited, but even regarding the same index structure, the average visit time is different if the broadcast sequence is different.
索引树的结构决定了平均访问索引节点的数目，但是即使对于相同的索引结构，如果采用不同的广播序列，则平均访问时间也不尽相同。
应用推荐