研究基于算法图的并行计算优化设计方法。
An optimal design method for parallel computing is presented based on algorithm graph.
将两种基于图论的算法图切割与随机游走应用于运动对象的分割。
Two algorithms, graph cut and random walk based on graph theory, were applied to motion segmentation.
将两种基于图论的算法图切割与随机游走应用于运动对象的分割。
Segmentation of motion objects based on graph cuts and C-V model;
理论和实验表明，在超低比特率图象通信应用领域，该算法图象压缩效率高，图象恢复效果好。
The theoretical and experimental results show that the proposed algorithm can achieve higher compression efficiency than DCT and the W transform based method in very low bit rate communication.
下面的图展示了一个通过使用DB 2BACKUP压缩算法来节省空间的示例。
The following diagram shows an sample of the space savings using the DB2 BACKUP compression algorithm.
而且，大多数代码基经常包含循环，我们使用了复杂的算法来处理这种循环，但依然能保证提供高效的层次图。
Further, most codebases often have cycles, and we have added sophisticated algorithms to work with such cycles but still provide effective layered diagrams.
BPEL4WS流程本身基本上就是一个流程图，类似于用来表达算法的流程图。
The BPEL4WS process itself is basically a flow-chart like expression of an algorithm.
图1和图2中的流程图显示了从stab格式收集信息的算法。
A flow chart representing the algorithm for getting the information from the STAB format follows in Figures 1 and 2.
显示从STAB提取调试信息的算法的流程图。
Flowchart showing the algorithm for extracting debug information from stab.
显示从STAB提取调试信息的算法的流程图(续)。
Continuation of flowchart showing the algorithm for extracting debug information from stab.
为此，提出一种直接按指纹梯度矢量的方向图进行指纹特征检出的算法。
For this reason, the authors propose a method to detect fingerprint features directly fr om the fingerprint gradient orientations.
算法来找到一个层次树在一个有向无环图吗？
Algorithm to find a hierarchy tree in a directed acyclic graph?
该算法首先通过对边缘密度图进行投影分析进行自顶向下的粗定位，然后在此基础上利用垂直边缘的连接强度进行自底向上的精确定位。
The algorithm first makes a top-down coarse location using the projection analysis of the edge density graph and then makes a bottom-up precise location based on the vertical edge linkage intensity.
另外，基于如路径-查询(Path - Search)算法的普通图，也易于通过遍历图来实现。
Additionally common graph based algorithms like path-searches are easy to implement by traversing through the graph.
图3展示了从DWARF获取信息的算法的流程图。
Figure 3 shows a flow chart representing the algorithm for getting the information from dwarf.
最后根据流程图给出一种混合的故障预测算法。
Finally, a kind of mixed fault prediction algorithm is presented.
给出了对应的电路原理图和功率算法。
And its corresponding circuit schematic diagram and power algorithm are given.
针对MAP法提出了具体算法和参数估计方法。并提出应用图象分割法来提高计算机复原速度，节省存储空间。
We derive the algorithm and parameters estimate method for the MAP restoration, and propose the image sectioning to speed up the restoration and save memory space.
c语言些的程序，数据结构中图的遍历算法实现。
C language of some of the procedures, the data structure in graph traversal algorithm.
详细说明：一个图象分割的算法原码。包括畸变矫正。
An image segmentation algorithm of the original code. including aberration correction.
通过需求分析及总体设计，对整个应用方案从数据流图到算法分析详细地给出了应用设计，在新的应用领域上进行了探讨和研究。
Through the analysis of demand and general design, It introduces the application from data stream to arithmetic analysis detailedly, discusses and researches this in a new applied field.
一些数据结构的基本算法，例如树，图的遍历等。
Some of the basic algorithm for data structure, such as trees, graph traversal and so on.
针对以上问题，该文提出了一种新的基于形状的图象检索算法。
To cure the above problems, this paper presents a novel shape based image retrieval algorithm.
提出了一种新的动态启发式二叉判定图(BDD)最小化算法。
A new dynamic heuristic binary decision diagram (BDD) minimization algorithm is proposed.
图的建立与遍历算法。
同时，在借鉴国内外研究成果的基础上，探讨了攻击路径的自动生成算法以及对攻击图相关的算法之间的优缺点进行了比较。
It has profited from the domestic and foreign research results, in this foundation, it discussed automatic production of attack path, as well as attack graph algorithm comparison.
提出一种基于高斯拟合的平面赤足迹图象分割算法。
A planar barefoot impression image segmentation method base on Gaussian fitting is proposed.
最后给出了一步成形模拟算法的程序流程图。
Finally, the program flow chart of one-step forming is given.
最后给出了一步成形模拟算法的程序流程图。
Finally, the program flow chart of one-step forming is given.
应用推荐