A pruned dynamic programming algorithm to recover the best segmentations with $1$ to $K_{max}$ change-points (Q106351)
From MaRDI portal
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A pruned dynamic programming algorithm to recover the best segmentations with $1$ to $K_{max}$ change-points |
No description defined |
Statements
6 April 2010
0 references
stat.CO
0 references
