Deterministic length reduction: Fast convolution in sparse data and applications

Amihood Amir; Oren Kapah; Ely Porat

doi:10.1007/978-3-540-73437-6_20

Deterministic length reduction: Fast convolution in sparse data and applications

Amihood Amir, Oren Kapah, Ely Porat

Department of Computer Science

Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

12 Scopus citations

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(n₁ log³ n₁), where n₁ is the number of non-zero values in V₁. This algorithm assumes that V₁ is given in advance, and the V₂ is given in running time.

Original language	English
Title of host publication	Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings
Publisher	Springer Verlag
Pages	183-194
Number of pages	12
ISBN (Print)	9783540734369
DOIs	https://doi.org/10.1007/978-3-540-73437-6_20
State	Published - 2007
Event	18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007 - London, ON, Canada Duration: 9 Jul 2007 → 11 Jul 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4580 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007
Country/Territory	Canada
City	London, ON
Period	9/07/07 → 11/07/07

Access to Document

10.1007/978-3-540-73437-6_20

Cite this

Amir, A., Kapah, O., & Porat, E. (2007). Deterministic length reduction: Fast convolution in sparse data and applications. In Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings (pp. 183-194). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4580 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-73437-6_20

Amir, Amihood ; Kapah, Oren ; Porat, Ely. / Deterministic length reduction : Fast convolution in sparse data and applications. Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Springer Verlag, 2007. pp. 183-194 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3a4a438f16c04574b0b9166afa115f59,

title = "Deterministic length reduction: Fast convolution in sparse data and applications",

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.",

author = "Amihood Amir and Oren Kapah and Ely Porat",

year = "2007",

doi = "10.1007/978-3-540-73437-6_20",

language = "אנגלית",

isbn = "9783540734369",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "183--194",

booktitle = "Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings",

address = "גרמניה",

note = "18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007 ; Conference date: 09-07-2007 Through 11-07-2007",

}

Amir, A, Kapah, O & Porat, E 2007, Deterministic length reduction: Fast convolution in sparse data and applications. in Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4580 LNCS, Springer Verlag, pp. 183-194, 18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007, London, ON, Canada, 9/07/07. https://doi.org/10.1007/978-3-540-73437-6_20

Deterministic length reduction: Fast convolution in sparse data and applications. / Amir, Amihood; Kapah, Oren; Porat, Ely.
Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Springer Verlag, 2007. p. 183-194 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4580 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Deterministic length reduction

T2 - 18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007

AU - Amir, Amihood

AU - Kapah, Oren

AU - Porat, Ely

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=37849018321&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-73437-6_20

DO - 10.1007/978-3-540-73437-6_20

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:37849018321

SN - 9783540734369

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 183

EP - 194

BT - Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings

PB - Springer Verlag

Y2 - 9 July 2007 through 11 July 2007

ER -

Amir A, Kapah O, Porat E. Deterministic length reduction: Fast convolution in sparse data and applications. In Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Springer Verlag. 2007. p. 183-194. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-73437-6_20

Deterministic length reduction: Fast convolution in sparse data and applications

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this