2007 | OriginalPaper | Chapter
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications
Authors : Amihood Amir, Oren Kapah, Ely Porat
Published in: Combinatorial Pattern Matching
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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(n_1 \log^3 n_1)$
, 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.