An efficient cache-oblivious parallel Viterbi algorithm (Q1693231)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6824393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient cache-oblivious parallel Viterbi algorithm |
scientific article; zbMATH DE number 6824393 |
Statements
An efficient cache-oblivious parallel Viterbi algorithm (English)
0 references
11 January 2018
0 references
Viterbi algorithm
0 references
cache-efficient
0 references
cache-oblivious
0 references
recursive
0 references
divide-and-conquer
0 references
parallel
0 references
multi-instance
0 references
rank convergence
0 references
0.7603942155838013
0 references
0.7595592141151428
0 references
0.75438392162323
0 references
0.7334312200546265
0 references
