以联动轴数作为输入考察插补速度,算法时间复杂度是对数阶的。
The algorithm running time is a logarithmic function of the number of linkage axes.
对数据离散化及属性选择度量方法作了改进,以降低计算复杂度,提高算法学习速度。
For decreasing calculation complexity and increasing speed of algorithm learning, it presented some improvement of data discretization and attributes selection measure.
A log algorithm typically is one where you cut the size of the problem down by some multiplicative factor.
对数级复杂度的算法就是指,通过一系列常量级步数的操作,可以将问题的规模。
It's a good sign that this is logarithmic, and I'm going to come back in a second to why logs are a great thing.
为什么对数级复杂度是个好事情,让我们再来看一个算法,噢,抱歉是让我们再来看两个算法。
Yeah. Is the last one there?
对数级复杂度的算法的优势对不对?
应用推荐