In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. The proposed algorithm performs the convolution in O(n1log3n1)O(n1log3n1), where n 1 is the number of non-zero values in V 1. This algorithm assumes that V 1 is given in advance, and the V 2 is given in running time.
|Original language||American English|
|Title of host publication||Annual Symposium on Combinatorial Pattern Matching|
|Editors||Bin Ma, Kaizhong Zhang|
|Publisher||Springer Berlin Heidelberg|
|State||Published - 2007|