时间复杂度

• In this density - based outlier mining algorithm , it takes two divided methods to get k - nearest neighbor , which efficiently reduces time complexity and space complexity
  基于密度的离群点挖掘算法对计算数据的k -最近邻采用二分法，较大减小了时间复杂度和空间复杂度。
• Our experimental evaluations show that our methods surpass the nmf not only in the easy and reliable derivation of document clustering results , but also in document clustering accuracies
  实验结果显示,在聚类的容易度、准确度、时间复杂度上均取得较nmf算法更合理的效果。
• During the research , we also studied the quantum algorithms . we found that there are some problems in grover ' s quantum search algorithm , and proposed an improved quantum search algorithm to resol
  在经典二分法的基础上，提出了二分法量子搜索算法，它的时间复杂度为o ( ( lo咖“勺。
• This algorithm holds a pipeline structure , it can reduce the time complexity of rendering object model greatly and take advantages of the general graphics hardware effectively
  该算法较大幅度地降低了模型绘制的时间复杂度，并能够有效利用现有的通用图形加速硬件，而无需特殊硬件支持。
• However , algorithms on trajectory planning are always high in time complexity and can ’ t converge quickly enough , which are not fit for the trajectory planning in the war
  而目前的航迹规划算法时间复杂度比较高,收敛速度较慢,对突发障碍物的处理往往不及时,不适合战场环境下的航迹规划。
• The simulation shows that the algorithm is of better performances , reduce the complexity of time and storage space , improve the expansibility and save network resources
  仿真结果表明该算法具有良好性能，减少了算法的时间复杂度和存储空间，网络的扩展性也得到改善，同时也节省网络资源。
• The integral image is used to calculate sub - block ' s statistic value , and it degrades the computational complexity from o ( n5 ) to o ( n3 ) , thus the speed of detection is improved remarkably
  从而在不降低检测精度的情况下，使检测的时间复杂度由o ( n ~ 5 )降低到o ( n ~ 3 ) ，缩短了人脸检测的时间。
• The resource - constrained scheduling algorithm reduces the power consumption by maximally utilizing given resources operating at reduced voltages and at the same time , reducing the latency
  本文中提出了基于gain大小搜索的时间和资源约束的调度算法，该算法具有较好的优化效果和较低的时间复杂度。
• Paths from start point to end point are founded , and the max - flow of boolean network is got by this way , which avoid conversion of graphics , and time complexity is lowered as well
  本论文利用标号法寻求起始点到终点的通路的方法,来求得布尔网络的最大流,使得图的变换减少,时间复杂度也随之减少。
• This algorithm can discovery the relationship of the events and can discover more knowledge and the cost is more cheap than other algorithm , the algorithm is concision , frank , it take only ( o ( n3 ) ) time
  该算法与其它算法比较，发现的知识更丰富，时空开销小，时间复杂度为( o ( n ~ 3 ) ) ，算法直观，简洁。