为了满足超大词表语法的识别任务在嵌入式语音识别系统上的应用，提出了一种高效的双层图搜索算法。
For the application of large vocabulary word lists to embedded speech recognition, an efficient two-layer graph search algorithm is proposed.
本文研究和分析了电路设计子图搜索算法的设计思路，提出了一种新的基于电路特征分析的电路设计子图搜索算法。
The paper studies circuit design subgraph search algorithm and puts forward a new search algorithm that bases on circuit character.
根据图的邻接表的性质，提出了基于邻接表存储结构的“潜藏通路”搜索算法。
According to the property of the adjacency list of graphs, the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented.
针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。
The traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.
在NAS-RIF算法中，提出了观测图象背景扩展的方案，并引入了支持域确定方法和改进的搜索算法，这些都提高了算法的效率。
Besides, the scheme extending the background of the image estimates is described in NAS-RIF. All of these will improve the efficiency of image restoration.
通过对矢量量化快速码字搜索算法的VLSI结构的研究，为进一步设计更为详细和复杂的图象编码系统提供基础。
Through the research of VLSI architecture of fast codewords search algorithms, we can provide a foundation for the implementation of detailed and sophisticated image coding schemes in the future.
改进了过渡运动的生成算法和路径搜索算法，提出了一种基于运动图的路径编辑的新方法。
This paper improved the algorithm of generating transitions and searching for path, and proposed a path editing method based on motion graphs.
这种基于证书图的搜索算法具有很好的可靠性和完备性，更加灵活、高效，能够适应海量证书分布式存储的国际互联网。
It is shown that the algorithm has good soundness and completeness, it is more flexible and efficient and has better performance in Internet where millions of certificates are distributed stored.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
Furthermore, an algorithm of certificate chain processing is presented, which searches the DAGs, and a DAG by depth-first-algorithm, and inter-DAGs by breadth-first-algorithm.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
Furthermore, an algorithm of certificate chain processing is presented, which searches the DAGs, and a DAG by depth-first-algorithm, and inter-DAGs by breadth-first-algorithm.
应用推荐