2023-08-19
2023-08-19
2022-04-09
2022-04-08
2022-04-07
2022-04-01
2022-01-30
2022-01-30
2022-01-18
2020-11-07
2020-11-04
2020-08-30
2020-07-25
2020-07-21
2020-07-18
2020-03-15
2020-03-13
2020-01-20
2020-01-03
2020-01-02
2019-12-08
2019-09-06
2019-09-02
2018-09-26
2018-09-24
2018-09-21
2017-06-10
2017-05-29
2017-03-18
2017-03-02
2017-02-16
2017-02-16
2017-02-11
2017-01-03
2017-01-02
2016-12-27
2016-12-19
2016-12-06
2016-12-04
2016-10-22
2016-10-21
2016-10-16
2016-10-15
2016-10-12
2016-10-11
2016-10-01
2016-09-30
2016-09-27
2016-09-25
2016-09-24
2016-08-20
2016-07-19
2016-07-16
2016-06-01
Implemented an iterative O(nlgn+kn) algorithm. This version completely eliminates the involved divide-and-conquer strategy reported in the literature and further reduced the overhead.
This implementation was later determined to be incorrect.
2016-05-30
Implemented an O(nlgn+kn) algorithm combining divide-and-conquer and dynamic programming. The space is still O(kn). The runtime is now practical for very large sample sizes for any number of clusters.
This implementation was later determined to be incorrect.
2016-05-25
2016-05-22
2016-05-22
2016-05-18
2016-05-15
2016-05-14
2016-05-07
2016-05-07
2016-05-03
2016-05-03
2015-02-10
2015-02-09
2014-03-24 and earlier
2010-10-26. Version 1.0 is released to CRAN.