Cite
HARVARD Citation
Mahlknecht, G. et al. (2017). A scalable dynamic programming scheme for the computation of optimal k-segments for ordered data. Information systems. pp. 2-17. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Mahlknecht, G. et al. (2017). A scalable dynamic programming scheme for the computation of optimal k-segments for ordered data. Information systems. pp. 2-17. [Online].