linear complexity的例句大全

This new edited sequences's period, linear complexity, symbol distribution and 1,2-complexity of weight are discussed in this paper.

文章讨论了这种新型的缩控序列的周期，线性复杂度，符号分布及1,2-重量复杂度等密码学性质。

Based on the queuing theory, Logistic mapping and Tent mapping, this paper presents a new method for generating the chaotic FH sequences through mixed mapping in order to increase the linear complexity and anti-prediction of chaotic FH sequences.

基于队列理论、Logistic映射和Tent映射，从增大跳频序列的线性复杂度和抗预测性出发，提出了利用队列排序方式产生混合混沌映射跳频序列的方法。

Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of key sequences.

序列的线性复杂度与k-错线性复杂度是度量密钥序列伪随机性的两个重要指标。

results show that most of these sequences have good linear complexity.

结果表明该类序列具有较好的线性复杂度性质.

But the linear complexity is relatively low and easy to calculate the little multinomial by B-M algorithm and decodes finally.

但常规型m序列，由于线性复杂性较低，容易由B-M等算法推出极小多项式，最终破译。

This method avoids possible memory overflow problem in normal reuse distance analysis, at the same time this method makes complexity of reuse distance analysis decrease to linear.

该方法有效地避免了一般复用距离分析可能导致的内存溢出问题，同时使得复用距离分析达到线性时间复杂度。

In the end of this chapter, the thesis answered a well known open question in the parameterized complexity. The open problem is whether every fixed parameterized tractability problems has a linear sized kernel.

这章中作者的主要工作是在全章的最后解决了一个参数复杂性研究中的重要的开放问题，回答了是否所有的确定参数可解问题都有线性大小内核这个问题。

Study on the trellis complexity of a few types of linear block codes

关于几类线性分组码网格图复杂度的研究

The result of simulation shows that Iterative Shifting Linear Searching is a kine of advanced PTS and achieves a good compromise between performance and complexity of computation.

结果表明，循环移位线性搜索法是一种改进的部分传输序列方法，在性能和计算复杂度之间取得了较好的折衷。

The paper analyzes the complexity of trust negotiation protocol, and its communication cost is linear, computing cost is O ( N · K).

还分析了信任协商协议的复杂性，其通信开销为线性，计算开销为O（N·K）。

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

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

The time complexity for this filtering or query is only linear function O ( N) of cardinality N.

这种过滤查询的时间复杂度仅是关系基数N的线性函数O（N）；

the equalizer with maximum a posteriori ( map) is replaced with a linear one based on the minimum mean-square error ( mmse) at the receiver so that the complexity of the system can be reduced greatly.

在接收端，采用基于最小均方误差的线性均衡器（MMSE-LE）代替基于最大后验概率（MAP）均衡器，这样可大大降低系统的复杂度。

design and implementation of an approximately linear average-case complexity algorithm for voronoi diagram of planar point set

近似线性平均复杂性的平面点集Voronoi图增量算法的设计与实现

lpsvr decreased computational complexity of time and space by replacing quadratic programming with linear programming.

LPSVR采用线性规划取代二次规划，使得计算的时间和空间复杂度大为降低。

theoretical analyses show that the method has a linear space complexity and converges to the global optimum.

对算法的空间复杂度和收敛性进行了理论分析。

indepth study to the time complexity of linear time selection algorithm

线性时间选择算法时间复杂度深入研究

both of them have linear time complexity.

两种编码算法都有线性的时间复杂度。

The time complexity of this algorithm is still linear.

算法的时间复杂度仍然是线性的.

Complexity: Linear to the number of elements in the circular list.

复杂度: 与循环链表中的元素数量成线性.