时间复杂度
例句与用法
- In addition , boundaries can be detected automatically during reconstruction . in order to dispose the large data , we use the divide and conquer method to improve the algorithm mentioned above
为了能够有效的处理海量数据,我们用分解再合并的思想对上述算法进行了改进,减小了算法的时间复杂度和空间复杂度。 - We further propose the simplified analytical approach ( s - rla ) on the basis of the e - rla technology , to reduce the high computation complexity of e - rla without loss of the precision of e - rla
针对这一问题,在保持e - rla算法精度的同时,结合前人工作,进一步提出了简化的分析方法( s - rla ) ,极大的降低了时间复杂度。 - As to the sting algorithm , the tune complexity of clustering is o ( n ) , but the time complexity of query is o ( g ) , where g is the number of grid cells at the lowest level and g is far smaller than n .
如sting算法,产生聚类的时间复杂度为o ( n ) ,但查询处理时间是o ( g ) , g是最低层网格单元的数目,通常g远远小于n 。 - The traditional methods on extracting content are representing the web page with the data structure of trees in the main memory . unfortunately , the space and time complexity is relatively high when building and searching the tree
传统的方法是将网页结构表示成树,但建树与查找树的过程中,空间与时间复杂度都过高。 - In this thesis , the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency
本文设计实现的一种专用于计算分支定界算法的机群计算平台,能减少分支定界算法的计算时间复杂度,提高分支定界算法的效率。 - The algorithm considers the occupation of communication channel . compare to other task scheduling algorithms , tdmsl has better performance , which has less processor consumption and lower time complexity
最后与其他几种常见的任务调度算法进行了对比测试,结果显示tdmscl在算法时间复杂度处理器消耗与调度长度上有性能优势。 - To our knowledge , our result is the first to achieve the optimal routing complexity while still keeping a poly - logarithmic number of bits of information stored on each node in the small - world networks
日前基于kleinberg理论模型的改进路由算法一般依靠增加local的awareness来提高路由效率。但此方案只能有限度改进路由时间复杂度。 - The analysis and experiment prove the time spent on query processing is nearly linear to the number of nodes in the graph , and the extra storage space used by query processing and the result storage space is low
理论和实验证明,该查询处理方法的时间复杂度接近数据图节点数的线形关系,处理查询时中间结果和查询结果所占空间均很小。 - A new fast filtering algorithm in which a mean value method is adopted is brought forward here , which can greatly decrease the temporal complexity if mid - value filtering method and therefore get a high efficiency in calculation
摘要讨论了一种新的中值滤波算法,有效地降低了传统中值滤波算法的时间复杂度,提高了计算效率和运算速度。 - The limitation of real computer systems is considered , so strategies with some difference are adopted for decision tables of different sizes and the time complexity of the attribute reduction algorithm is also different
本文所给的这个算法考虑了具体实现的限制,因而对不同大小的决策表采取有所不同的策略,算法的时间复杂度是不同的。