查询词典 algorithms

On object division algorithm based on 3D information: the algorithms for object surface division are studied and a new algorithm is presented.

关于目标物体分割算法：讨论了利用框架特征的目标物体表面分割算法，提出了一种基于立体信息的目标物体表面分割算法。

At present, most of the DOA estimation algorithms are used in the Gaussian noise environment.

目前，大多数的DOA估计算法是应用在高斯噪声环境下的。

In such doing, this dissertation serves as a step stone for papers of its counterparts to come, and, more importantly, it proposes a strategic alternative to the realization of models for image processing. This dissertation consists of three major parts. In the first part, detailed discussions and delicate analyses of academic papers on Cellular Neural Network will be provided in the hope of helping us see the potentiality of Cellular Neural Network in the applications of image processing. I will focus on the aforementioned limitations on hardware compilation as well. In the second part, I will put forth "texture analysis" as one basic model of analysis when we apply Cellular Neural Network to image processing. In this so-called texture analysis, a useful "spatial feature" is especially drawn to help us overcome possible problems of more complicated Cellular Neural Network applications in image processing."Spatial feature" also serves as a well-functioning mechanism for technology of image identification. In the last part of this thesis, I will look into a case study, where Cellular Neural Network is applied to help de-screen document image. Using it as an example, we will see how algorithms of Cellular Neural Network may be of marvelous use in applications in document image processing, since it would reduce a great deal of calculation and computation when applied to software compilation, yet opens up unlimited possibilities for higher-speed hardware compilation of high-level image processing.

这篇论文主要可以分为三大部分：在第一部份里，我们会详细地说明并讨论在过去到现在大部分将分子类神经网路应用於影像处理的相关文献及未来所有可能的发展和技术，另外也将分子类神经网路作一完整的介绍，除此之外，我们也会特别著重於分子类神经网路在影像处理相关应用理论的讨论以及其硬体实现化的考量；在第二部分里，我们提出了一个将分子类神经网路应用於影像辨识处理的基础分析—纹路分析，这是由於纹路分析的复杂性和普遍性会使得分子类神经网路於高阶影像处理的应用不会只局限在单一的影像处理技术，其中我们也提出了一个相当有用的空间特徵，此一特徵不但可以使复杂地高阶影像处理能够应用分子类神经网路，也为影像辨识技术提供了一个很好的辨识机制；在最后一部分里，我们也将文件影像分析做了一个完整的剖析，并以文件影像的去网点为例来说明在实际情况下的分子类神经网路的应用，如此演算法的开发也为文件影像处理提供了更多实际的应用，更考量了文件影像处理若以软体实现时的计算量负荷，而对未来高阶数位影像处理能够以硬体实现来提高处理速度提供了无限的可能。

In this dissertation we propose a set of fast algorithms for computing the DGFT (Discrete Generalized Fourier Transforms) over the hexagon domains and the parallel dodecahedron domains and give the parallel implementation on Linux clusters.

本文在理论上的主要贡献就是利用多色排序、区域分解和多重网格的思想，设计了二维三方向平行六边形区域和三维四方向平行十二面体区域上广义离散傅立叶变换的快速算法并给出它在PC Linux机群上的并行实现。

In medical informatics, the integration of domain knowledge into clustering algorithms was stressed. Data visualization of hierarchical clusters could be applicable in On-Line Analytical Processing of data warehouse.

在医学资讯学方面，则探讨阶层式集群的建构过程中，有多处应用专业知识微调的机会，此外并试验在资料仓储的线上分析处理上应用的可能性。

Then, we study Rough Set Theory approach to KDD, develop two algorithms for deriving Reduct and propose the integration of domain knowledge into Rough Set Theory to mining multiple-level rules.

本文在分析了传统的关联规则挖掘算法的基础上，给出了几个挖掘算法和一个递增修正算法；提出了模糊关联规则的概念及其挖掘算法；研究了结合背景知识的多层次关联规则的挖掘方法。

The book is presented in a user-friendly handbook format, with use of tables and algorithms to ensure that it is portable, accessible and can be read and referred to on, or before going to, the ward, or before a domiciliary visit.

这本书介绍了用户与表和算法使用友好手册的格式，以确保它是便携式的，可以访问和读取，并提到，或去之前，病房前，或在一家居访问。

Although finding the Minimum Connected Dominating Set in an arbitrary graph is a NP-hard problem, many approximation algorithms have been proposed to construct a serviceable CDS.

由于求解最小连通支配集是一个NP难问题，许多近似算法被提出用于构建可用的最小连通支配集。

Although finding the Minimum Connected Dominating Set in an arbitrary graph is a NP-bard problem, many approximation algorithms have been proposed to construct a serviceable CDS.

由于求解最小连通支配集是一个NP难问题，许多近似算法被提出用于构建可用的最小连通支配集。

Compared with the well-known SOS algorithms, the results show that this algorithm is far more effective to solve DOP than SOS algorithm.

通过测试典型的动态优化问题，并与经典的SOS算法进行比较，证明了算法的有效性。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。