Deterministic length reduction: fast convolution in sparse data and applications

Authors:
Amihood Amir;Oren Kapah;Ely Porat
Affiliations:
Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel;Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel;Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel
Venue:
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Year:
2007

Citing 7
Cited 1

Introduction to algorithms

Introduction to algorithms
A survey of image registration techniques

ACM Computing Surveys (CSUR)
Verifying candidate matches in sparse and wildcard matching

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient Visual Recognition Using the Hausdorff Distance

Efficient Visual Recognition Using the Hausdorff Distance
Bidirectional Deformable Matching with Application to Handwritten Character Extraction

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Matching for Spatial Point Sets

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Sweepline the music!

Computer Science in Perspective

Blocked pattern matching problem and its applications in proteomics

RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(n1 log3 n1), where n1 is the number of non-zero values in V1. This algorithm assumes that V1 is given in advance, and the V2 is given in running time.