Additionally, the new algorithm has time complexity of O ( N).

Label propagation algorithm ( LPA) is a fast community detection algorithm with near linear computational complexity.

标签传播算法（LPA）是一个著名的接近线性时间复杂度的快速非重叠社团发现算法，其算法过程非常简单明了。

互联网摘选

The method of this text can not merely be discerned kind of any form size, can fitter outside the noise data effectively, time bottom very too complexity.

本文的方法不仅能识别任意形状、大小的类，可有效过滤噪声数据外，时间复杂度也很低（为0（n））。

互联网摘选

Also we analysed the embedding congestion and the time complexity of these two embedding algorithms.

并且分析了在这两种嵌入方式下，FFT算法在环形光网络中的拥挤度和时间复杂度。

互联网摘选

According to experiment results, comparison analysis is made between Entropy algorithm and Basic Incognito algorithm, including time complexity analysis and precision analysis.

根据实验数据结果，对Entropy算法与Basic Incognito算法的性能进行了比较分析，包括时间复杂度分析以及精确度分析。

互联网摘选

The computing time complexity is O ( men1).

计算时间复杂度是O（men l）；

互联网摘选

The time and the space complexity of the algorithm are lowest.

性能分析表明该算法具有最小的时间复杂度，并且在基于半边Z结构的情况下具有最小的额外空间复杂度。

互联网摘选

Mutual information selects the salient feature subset according to the relevance between feature and class by a forward greedy search strategy, which belongs to filter method.

互信息根据特征与类的相关性，通过前向贪心搜索机制为子分类器选取相应的特征子集，属于Filter类的特征子集划分算法，该算法具有时间复杂度小的优点。

互联网摘选

This algorithm is better than the Floyd algorithm in average time complexity.

该算法在平均时间复杂度上比传统的Floyd最短路径搜索算法有较大的提高。

互联网摘选

However, multi-magic square is a typical NP problem, time complexity that computer search a magic square are more than people think.

然而，多重幻方是一个典型的NP难题，利用计算机搜索幻方的时间复杂度是超乎人们想象的。

互联网摘选

In despite of the theoretic time complexity of the algorithm is O ( n2), the results show that the average time complexity is approximately O ( n).

通过几个新技术的应用加速算法之后，试验结果表明算法的平均时间复杂度近似O（n）。

互联网摘选

The time complexity of traditional substring reduction algorithms is O ( n~ 2), which is ineffective for large-scale corpora.

传统的子串归并算法时间复杂度为O（n2），在大规模语料库的处理中效率低下。

互联网摘选

The running time of the algorithm is O ( n) where n is the cardinality of E.

算法时间复杂度为O（n），其中n为E的元素数目。

互联网摘选

The structured P2P system adopts routing algorithms which support a distributed hash table ( DHT) functionality, locates and searches data objects by precise keywords.

结构化P2P系统采用支持分布式哈希表（DHT）的路由算法，根据精确关键字进行对象的定位与发现。

互联网摘选

They provide a Distributed Hash Table ( DHT) function for mapping keys to overlay nodes.

这些覆盖网络利用分布式哈希表（Distributed Hash Table，DHT）把关键字映射到覆盖网络的节点中。

互联网摘选

High Performance URL Filter Based on Hash Table

基于哈希表的高性能URL过滤器研究

互联网摘选

Web Service Discovery Based on DHT Peer-to-Peer Network

基于分布式哈希表对等网络的Web服务发现

互联网摘选

A fast content routing lookup algorithm on hash and trie tree basis

一种基于哈希表和Trie树的快速内容路由查找算法

互联网摘选

Generally, these structured P2P networks are based on DHT ( Distributed Hash Table) and with the advantage of good scalability.

这些结构化的P2P网络通常都基于分布式哈希表（Distributed Hash Table，DHT），具有可扩展性好等特点。

互联网摘选

With the help of distributed Hash table, the structured P2P ( peer-to-peer) network has a short routing path and good extensibility.

利用分布式哈希表，有结构的对等（peer-to-peer，简称P2P）网络具备了较短的路由长度和较好的扩展性。

互联网摘选

Synthetic match and Hash table are introduced to improve SPECK.

算法中还引入了哈希表和综合匹配法对SPECK算法进行了改进。

互联网摘选