logn

The conclusion that the time complexity is O ( n + logn ) is reached by the algorithm .

得出了该算法时间复杂度为O（n+logn）的结论。

Objective : To investigate the treatment of bone defects and nonunion in logn bone shaft after fracture .

目的：探讨四肢长管状骨骨不连、骨缺损的治疗方法。

What materials should be prepared before apply the " Immunohistochemical Stain Service "? How logn would it take ?

选择免疫染色之服务项目需要准备什麽？此服务项目需多久时间？

The logn bag filled with sand is a new type material for dam building and emergency harnessing of river .

本文对充沙长管袋这种新型的筑坝、抢险整治工程材料进行了抛掷沉降运动的力学分析研究与模拟计算。

The conclusion is obtained that its time complexity is reduced from O ( n ) to O ( logn ) .

得出了运用该算法将时间复杂度从O（n）减少到O（logn）的结论。

How to swing leg is an important component in logn jump , and the most critical part in long jump .

摆动腿的摆动技术作为起跳动作结构中的一个重要组成部分，也是跳远的一系列技术环节中最为关键的部分。

An o ( n ~ 2 logn ) algorithm for finding all strongly visible pairs of points of a finite planar point set

有限平面点集强可见点对的O（n~2logn）算法

Every node only maintain O ( 1 ) node information and find destination resource within O ( logN ) average logic routing hops .

实现了在维护O（1）节点信息的情况下，平均查找逻辑路由跳O（logN）内查找定位任意网络资源。

According to this rule , the parallel selection algorithm executed in time O ( logn logm ) on n processors is given .

最后由此规律给出了一种在n个处理器上可在O（logn·logm）时间步内完成的并行双调选择算法。

To obtain a linear relationship between logN and log ( S-S0 ) from test data of P-S-N curve is presented in this paper .

该方法可以使P-S-N曲线试验数据在双对数坐标系lgN-lg（S&So）中最大限度地呈现线性关系。

The space complexity of the algorithm is only O ( n ) while the time complexity approximates to O ( n2 ? logn ) .

该算法的空间复杂度仅为O（n），时间复杂度近似为O（n2·logn），且预测结构有较好的精度。

All these algorithms run in O ( logn ) time using O ( n ) processors , where n is the number of vertices in the tree .

对n个顶点的树，以上算法均使用O（n）个处理机，时间复杂度为O（logn）。

The maximum number of serial computations , which is a measure of the processing time , is approximately proportional to logN , where N is the number of busses or nodes in the power system .

如果N是电力系统的节点数，那么，这种方法的最大计算量（它与计算机处理所需时间相关）近似正比于logN。

Among lots of DHT based structured P2P systems , the constant-degree system has two novel characteristics : the neighbor degree of each peer is constant and the lookup efficiency is O ( logN ) .

常量度P2P系统作为一种新型的结构化系统，具有邻居节点个数为常数而查询效率为O（LogN）的特性。

Some classic P2P system , like Chord , CAN , Pastry and Tapestry , can achieve a path length of O ( logN ) by using O ( logN ) neighbors per node .

经典的P2P系统，如Chord、CAN、Pastry和Tapestry，都达到了O（10gN）的查询路径长度，每个节点维护O（logN）个邻居节点。

This paper presents an algorithm for determining convexo-concave venices of an arbitrary polygon . The algorithm requires O ( n2 logn ) multiplications and O ( n2 ) comparisons .

本文提出一种确定任意多边形凸凹顶点的算法.该算法的时间复杂性为O（n2logn）次乘法和O（n2）次比较。

The algorithm can adaptively decrease the time complexity for line clipping , ranging from O ( logn ) to O ( n ), but less than O ( n ) in most cases , where n is the number of the edges of the polygon .

该方法能自适应地降低裁剪计算的复杂度，使其在O（logn）和O（n）之间变化，并在大多数情况下小于O（n），其中n是多边形边数。

With the amount of nodes increasing in the network , the average searching time and the average searching hops have a better O ( logN ) performance ; The node failure mainly only affects the exited nodes and makes minimal effect on the non-failed nodes in the network .

随着网络中节点数量的增加，平均查找时间和平均查找跳数具有较优的O（logN）性能；节点失效基本上只对退出网络的节点的查找有影响，对未失效节点影响极小。

This paper , first , based on Batcher 's principle of bitonic merging , proposes the bitonic selection network in which the number of comparators is O ( nlog ~ 2m ) and the delay time is O ( logn logm );

本文首先基于Batcher的双调归并原理，提出一种比较器数目和延迟级数分别为O（nlog~2m）和O（logn·logm）~（2））的双调选择网络；