algorithm complexity的例句大全

We propose a low complexity suboptimal user selection algorithm for downlink MU-MIMO systems with BD-GMD.

因此,提出了一种次最优但是计算复杂度较低的用户选择算法,用于采用BD-GMD 方案的下行MU -MIMO 系统.

This algorithm has low time complexity , and can also be implemented easily and in distributed fashion.

这个算法时间复杂度低, 容易分布式实现.

The time complexity of this algorithm is still linear.

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

The proposed algorithm can overcome the drawback of CBP algorithm and its time complexity increases to.

该算法克服了CBP算法 机械选取节点进行划分的缺点,同时算法复杂度也增大到.

The algorithm avoids the great complexity of deducing cutting-pattern and solving LP.

该算法避免了求解大量下料方式及求解大规模整数规划的复杂问题.

The existing algorithm for Elliptic Curve discrete logarithm problem ( ECDLP ) is the whole index time complexity algorithm.

现有的求解 ECDLP 的算法都是全指数时间复杂度的算法.

The bit-operation complexity of the fast exponential algorithm is polynomial.

快速指数算法的比特运算复杂度是多项式的.

While considered from the complexity of algorithm and denoising effect the QRDLSL is best.

综合考虑计算复杂程度和滤波效果,基于QR分解 的最小二乘格型自适应滤波算法最佳.

Simulation results show that with complexity greatly reduced, piecewise linear approximation algorithm achieve a performance very close to that of the BP algorithm.

仿真结果表明，曲线折线化算法在复杂度大幅度降低的情况下性能接近BP算法。

The time complexity of this algorithm is equal to O ( nlogn+ n [ d/ 2]), if an auxiliary data structure called Delaunay Tree is used in it.

如果采用一种称为Delaunay树的数据结构来辅助点的定位，则算法的效率为O（nlogn+n[d/2]）。

This paper develops Zhu-Liu algorithm [ 1] to the minimum spanning arborescence with bi-weight and deduce and polynominal algorithm with O ( mn) complexity using lexicographic order.

本文在朱－刘算法的基础上，讨论了网络双权最小树形图问题.采用字典序方法得到了该问题的一个复杂性为O（mn）的多项式算法。

In this paper, we study the properties of the spanning arborescence in a network, and propose a simple algorithm for finding the minimum arborescence in a network, we also discuss the complexity of this algorithm and present an example for applying this algorithm.

研究网络中支撑树形图的性质，提出了在网络图中寻找最小树形图的简易算法，并对算法的复杂性进行了讨论，还给出应用该算法进行计算的一个实际算例。

The algorithm complexity is.

算法的复杂度为.

If we are to raise compression speed, then the algorithm complexity must increase.

如果要提高压缩速度, 那么算法的复杂度就得增加了.

This algorithm can solve the large scale problem because its computing complexity is small.

该算法计算量小，可应用于大规模优化调度问题。

Comparing with artificial participation, algorithm complexity can obviously accelerate the processing speed.

相对于人工参与量，算法复杂度的降低能显著加速处理进程。

Finally, the algorithm complexity has also been analyzed in detail.

分析了算法的存储与计算复杂度。

The problems such as the algorithm complexity and the sampling period are also discussed.

并讨论了这些算法的时间复杂度，采样周期等问题。

Parallel fast Fourier transform algorithm is used to calculate the Coulomb field distribution, and reduce the complexity of the algorithm. The computing speed is substantial increased.

利用并行快速傅立叶变换算法计算库仑场分布，降低算法复杂度，使计算速度大幅提高。

The algorithm transforms the complex covariance matrix into a real matrix using an unitary transformation and then the real matrix is inversed and eigen-decomposed for adaptive beamforming so it has a low computation complexity in comparison with the ESB adaptive beamforming algorithm.

该算法利用酉变换将复协方差矩阵转换为实矩阵，然后对其求逆和特征分解进行自适应波束形成，因此其运算量比ESB自适应波束形成算法小得多。