Each device tree has only devices assigned to that partition.
每个设备树仅包含分配给这个分区的设备。
It also generates the device tree specific to the partition.
它还可以生成特定于该分区的设备树。
In this algorithm, dynamic programming is used to calculate optimal local cosine tree during the LCT for signals, and the optimal entropy code is gained by the best partition of time axes.
算法对信号进行局部余弦变换时采用动态规划算法计算最佳局部余弦树，通过获得信号在时间轴上的最佳划分来获得信号的最优嫡编码。
The performance of this approach strongly depends on the appropriate partition of the tree and the selection of proxies.
这种方法的性能依赖于对组播树适当的划分和代理的位置。
Hybrid Mode installs applications to a partition or loop back file in a traditional "one file tree" way.
混合模式的应用程序安装到一个分区或在传统的“一个文件树”的方式回送文件。
Last, the partition algorithm which has been improved is proposed, meanwhile, the basic idea of Minimum Cost Spanning tree is presented.
最后，给出了改进的基于划分的聚类方法，以及其中涉及到的最小生成树算法的基本思想。
QR-tree, a spatial index structure based on R-tree and a kind of space partition method using Quad-tree, is proposed. Its data structure and algorithms are also stated.
提出了一种基于R-树与“四叉树”空间层次划分的空间索引结构QR-树，给出了其数据结构和算法描述。
QR-tree, a spatial index structure based on R-tree and a kind of space partition method using Quad-tree, is proposed. Its data structure and algorithms are also stated.
提出了一种基于R-树与“四叉树”空间层次划分的空间索引结构QR-树，给出了其数据结构和算法描述。
应用推荐