A fast algorithm for computing MDCT is presented, and its computation complexity is analyzed.
提出了一种计算MDCT的快速算法，并分析了算法的计算复杂度。
EESSPA algorithm can avoid the information explosion by distributed control. Its computation complexity is independent of the number of hops along the path.
EESSPA算法的特点是采用分布式控制，避免了由于集中式控制导致的信息爆炸，并且算法复杂度与途经链路数无关。
Compared with traditional lattice methods, the algorithm have an obvious progress in the computation complexity and storage.
同传统格型算法相比，这种算法的计算复杂度和存贮量均有明显改善。
The results show that the algorithm has relatively higher precision and lower computation complexity.
结果表明，该算法具有较高的精度和较低的计算复杂度。
The algorithm USES the channel correlation in the frequency domain to greatly reduce the computation complexity and the number of required samples.
利用信道频率相关特性降低了算法复杂度，同时解决了算法对样本数的依赖问题。
Experimental results show that this algorithm can reduce the complexity of the computation and well assures the quality of images stitching as well.
试验结果表明，该算法不但降低了计算复杂度，还很好地保证了拼接质量。
To improve the deficiency of logic operation complexity and computation complexity, a new reasoning algorithm based on causality diagram's characteristic has been presented.
针对因果图推理中存在逻辑运算量大、计算复杂的困难，提出了一种基于因果图的特性的新的推理算法。
Simulation results show that the algorithm improve the system's throughput and guarantees the fairness among users while not increasing its computation complexity.
算法在没有增加计算复杂度的情况下，提高了系统吞吐量并保证了用户之间的公平性。
Compared with other error concealment algorithm with comparable computation complexity, this algorithm has a better recovered image quality, both in subjective and objective criterion.
与运算复杂度相当的同类算法相比，该算法的修复图像质量无论在客观评价准则和主观评价准则上都有一定的提高。
However, as the complexity of the scenes increasing, this algorithm may slow down the render efficiency because it needs more computation.
但是随着场景复杂度的增加，该算法计算量比较大，将导致绘制效率的降低。
The RBC is characterized with high fidelity of the restored image and low computation complexity of the compression algorithm, and so it is quite suitable for high speed real time compression usage.
RBC方法的主要特点是恢复图像的高保真和压缩算法的低运算复杂度，因此十分适合高速、实时压缩应用。
Because the computational complexity of this algorithm is allocated to parallel cells, so the computation speed will be greatly increased.
由于该算法的计算复杂性分摊于各并行处理单元，因而计算速度大幅度提高。
Without increasing the complexity of previous warping method, this algorithm greatly reduces the computation required in image synthesis from multiple reference images.
算法在不增加原有图像映射算法复杂度的基础上，大大降低了原有多幅图像合成算法的计算量。
In addition, this algorithm is easy to implement for its low computation complexity.
另外，该算法不仅计算复杂度低，且易于实现。
In the process of compressing the ROI, to decrease the complexity of computation and ensure the quality of the image, integer wavelets transform and arithmetic algorithm are used.
对感兴趣区域(ROI)进行无损压缩编码过程中，采用整数小波变换然后进行算术编码的方案降低运算复杂度、保证图像质量。
The results show that our proposed algorithm achieves vivid edges of target images, and has lower computation complexity and easy for hardware implementation.
研究表明，运用该算法插值获得了边缘清晰的目标图像，且该算法复杂度低，便于硬件实现。
The experimental results demonstrate that the proposed algorithm has the advantages such as simple computation complexity, good robustness to JPEG, and precise location of tampered areas.
实验结果表明，该算法计算简单，不仅有很好的抗jpeg压缩性能，同时对篡改的定位也很精确。
It is of lower complexity in computation and far more easy to be implemented as compared with the original steepest descent algorithm.
新算法与传统的最陡下降算法相比，具有运算量小、容易实现等优点。
In the project I introduce a self-accelerate features matching algorithm which guarantee both precision and computation complexity.
在本项目中，我们使用了加速的特征点匹配算法，保证了算法的精度和速度；
Experimental results show that the algorithm is superior than many others in terms of detection accuracy, false detection percentage and computation complexity, so the system is more practical.
实验结果表明，该算法在检测成功率、误检率和时效性等方面都优于其它算法，更能满足工程实践的需要。
Finally a3780-point FFT algorithm is introduced in brief, whose capacity complexity and computation complexity are close to the conventional4096-point FFT.
最后简要介绍了实现3780点快速傅立叶变换(FFT)的算法。其计算复杂度和容量复杂度都与标准的4096点FFT算法相当。
The computation result of the improved algorithm is better than that of Clarke aed Wright algorithm in most Gases, but its Complexity is slightly worse than that of the latter.
改进算法的计算复杂性虽不如c.w。算法，但计算的数值结果在大多数情况下比C.W。算法的结果更好。
In order to improve the high computation complexity and delay of centralized scheme, we proposed least square based joint admission control and power allocation algorithm.
针对集中式功率控制方式循环收敛速度慢的缺点，本文提出了基于最小二乘的功率及接入控制算法。
In order to improve the high computation complexity and delay of centralized scheme, we proposed least square based joint admission control and power allocation algorithm.
针对集中式功率控制方式循环收敛速度慢的缺点，本文提出了基于最小二乘的功率及接入控制算法。
应用推荐