This paper proposes a fast algorithm DMFP and an updating algorithm IUMFP, which are based on Prefix Tree for mining maximum frequent patterns.
因此,文章提出了一种最大频繁模式的快速挖掘算法DMFP及更新算法IUMFP。
This paper presents an approximate algorithm for updating the shortest path tree of moving target to avoid re-generate the whole tree.
提出一种更新移动目标最短路径树的近似算法来避免重新生成整棵路径树。
After the analysis of the updating condition for index table and probability interval, an optimized algorithm based on partial parallel scheme was presented for arithmetic encoder(AE) in JPEG2000.
通过对索引表和概率间隔区间更新条件的分析,提出了一种JPEG2000算术编码器的部分并行优化算法。
应用推荐