为了减少块匹配过程中每个待匹配位置的运算次数，保持块匹配的精度，又引入了连续排除算法，降低了计算复杂度。
In order to reduce the calculation number of matching position and keep the precision, we make use of the successive elimination algorithm. Therefore, the complexity was reduced.
此算法通过引入有符号和无符号滑动窗口编码方法，大大减少了标量乘算法中费时的加法运算次数。
This algorithm greatly reduces times of addition operation which takes time for scalar multiplication algorithm by introducing signed and unsigned sliding window coding methods.
引入了“可达矩阵”的概念，利用可达矩阵计算出了公交线网的平均换乘次数，并给出了算法。
Moreover, introduce the idea of reachability matrix, by which, figure out the average transfer times and come out the arithmetic.
应用推荐