计算复杂度

• Calculations of computational complexity seem to be one of the harder subjects for students ; there s no doubt of their value , though , when they lead to such speedups
  对于学生来说，计算“计算复杂度”似乎是较难的课题之一；但是当这些方法产生这样的加速时，它们的价值无庸置疑。
• Abstract in order to reduce the computational complexity of motion estimation and improve the accuracy , a fast motion estimation algorithm based on low frequency sub - image is proposed
  摘要为了减少运动估计的计算复杂度并提高其搜索性能，提出了一种基于低频子图的运动估计算法。
• Experimental results and analysis of computational complexity prove the proposed distributed method to be of low complexity , easy in implementation , and well performed in real time
  通过计算复杂度分析和实验,证明该分布求解方法具有计算复杂度低、实时性能好、易于实现等优点。
• A retiming algorithm fam which based on simple retiming is introduced in the paper , the time computation complexity of the algorithm is better than the classical algorithm feas
  本文在基于简单重定时的基础上提出了一种重定时算法fam ，此算法的时间计算复杂度较经典算法feas有所改善。
• 6 chang c c , cong j . pseudo pin assignment with crosstalk noise control . in proc . international symposiums on physical design , san diego , ca , april 9 - 12 , 2000 , pp . 41 - 47
  虽然上述很多模型在计算电感上都比较精确，但是用于大规模计算时，计算复杂度太大以至于无法应用到布线过程的噪声优化中。
• Compare with the original h . 264 encoder , the proposed encoder costs only 50 % ~ 60 % of the computational time . the simulation results demonstrate the good performance of the proposed coder
  这种算法与原始的h . 264算法相比较,不仅大大提高了算法的鲁棒性,而且使其计算复杂度下降到原来的50 % 60 % 。
• The results indicate that in each case , rci - based svm yields a much better performance than the normal ci - based svm but lower computation cost during training and classification phases
  它原理简单，计算复杂度低，非常适合大规模文本分类的需要。事实上，概念索引在实际应用中取得了相当不错的效果。
• In this thesis several popular subspace methods have been analysed and successfully realized in mutibis fr sub - system . however , each kind of subspace method might loss some important features
  数据在子空间中的分布更加紧凑,可分性好,计算复杂度也得到了很大降低,并为数据的描述提供了更好的手段。
• It reduces greatly the computational complexity of matrix - vector multiplication in conjugate gradient iteration improves the efficiency of mlfma while the reasonable accuracy is maintained
  该方法在保证合理计算精度的同时大大降低了迭代过程中矩阵矢量相乘的计算复杂度，提高了多层快速多极子方法计算效率。
• The first algorithm computes up + vq of koblitz curves . its complexity is n / 2 ( n is the extension degree ) addition of two points . the result is better than other algorithms we have known
  第一种算法计算koblitz曲线上的up + vq ，其计算复杂度为n / 2 ( n为扩域次数)次椭圆曲线的加法，此算法较目前所知的算法为优。