A pruned dynamic programming algorithm to recover the best segmentations with $1$ to $K_{max}$ change-points (Q106351)

From MaRDI portal
Revision as of 15:42, 25 April 2024 by Import240425040427 (talk | contribs) (Added link to MaRDI item.)
scientific article from arXiv
Language Label Description Also known as
English
A pruned dynamic programming algorithm to recover the best segmentations with $1$ to $K_{max}$ change-points
scientific article from arXiv

    Statements

    6 April 2010
    0 references
    stat.CO
    0 references
    0 references

    Identifiers

    0 references