| cf611db | Daniël de Kok | 06 April 2016, 08:04:31 UTC | README: tinyest is not for classification | 06 April 2016, 08:04:31 UTC |
| b54b2da | Daniël de Kok | 06 April 2016, 08:02:18 UTC | Link to a description of the TADM format. See #2. | 06 April 2016, 08:02:18 UTC |
| 7fe00ac | Daniël de Kok | 17 July 2013, 12:41:22 UTC | Update copyright header. | 17 July 2013, 12:41:22 UTC |
| 3e7388f | Daniël de Kok | 15 July 2013, 16:53:38 UTC | Use an enum for command line options. There are too many options now for using hard-coded integers. | 17 July 2013, 12:23:47 UTC |
| 5841191 | Daniël de Kok | 12 December 2012, 10:44:50 UTC | Remove memcpy where assignment suffices. | 12 December 2012, 10:44:50 UTC |
| 3d37827 | Daniël de Kok | 12 December 2012, 10:42:03 UTC | Check malloc/reallocs. | 12 December 2012, 10:42:03 UTC |
| c8f4306 | Daniël de Kok | 20 November 2012, 12:43:48 UTC | Add an optimization when sorting features by their gradients. Applying qsort to an array of feature_score_t is faster than feature_score_t *, since this struct is only two machine words anyway. | 20 November 2012, 12:43:48 UTC |
| e5b7665 | Daniël de Kok | 20 November 2012, 12:29:10 UTC | Selection: do not traverse the whole feature list. Since the candidate list is already ordered by the absolute value of the gradients, once a gradient is smaller than the provided prior, there is no need to traverse the rest of the list. | 20 November 2012, 12:29:10 UTC |
| aa57e2a | Daniël de Kok | 22 February 2012, 15:46:42 UTC | Add print decent messages for LBFGS errors. | 22 February 2012, 15:46:42 UTC |
| 4e2abe3 | Daniël de Kok | 22 June 2011, 21:58:56 UTC | Git ignores. | 22 June 2011, 21:58:56 UTC |
| 7c9d110 | Daniël de Kok | 03 June 2011, 09:07:34 UTC | Only build the tinyest program while things are not ABI/API stable. | 03 June 2011, 09:07:34 UTC |
| 88595ad | Daniël de Kok | 31 May 2011, 14:18:24 UTC | Update liblbfgs to version 1.10. | 31 May 2011, 14:18:24 UTC |
| ad6b3ee | Daniël de Kok | 31 May 2011, 13:42:34 UTC | Use long doubles when calculating sums/z. The exponent of some large negative numbers were rounded to zero, leading to a normalizer (z) with the value 0. | 31 May 2011, 13:42:34 UTC |
| 9cc16e1 | Daniël de Kok | 20 May 2011, 19:37:11 UTC | Clean up most of the maxent.h API. | 20 May 2011, 19:37:11 UTC |
| d3d8741 | Daniël de Kok | 20 May 2011, 19:29:49 UTC | Add a note about Visual Studio C99 support. | 20 May 2011, 19:29:49 UTC |
| 53bc2b5 | Daniël de Kok | 17 April 2011, 17:12:15 UTC | Move allocation of model_t.f_restrict to model_new. | 17 April 2011, 17:12:15 UTC |
| 9fbd993 | Daniel de Kok | 07 February 2011, 21:20:34 UTC | Merge branch 'master' of github.com:danieldk/tinyest | 07 February 2011, 21:20:34 UTC |
| b7c8c90 | Daniël de Kok | 07 February 2011, 21:13:20 UTC | Create install targets. | 07 February 2011, 21:17:12 UTC |
| 6554aec | Daniel de Kok | 27 January 2011, 13:22:31 UTC | Moved include to include/. | 27 January 2011, 13:22:31 UTC |
| 213a780 | Daniel de Kok | 21 January 2011, 18:17:39 UTC | Fix some warnings (some found with clang). | 21 January 2011, 18:17:39 UTC |
| 24a6a22 | Daniel de Kok | 21 January 2011, 18:15:31 UTC | Add headers as dependencies of the tinyest library. | 21 January 2011, 18:15:31 UTC |
| 09c99ae | Daniel de Kok | 06 December 2010, 10:22:33 UTC | Usage: --grafting-light. | 06 December 2010, 10:22:33 UTC |
| 45114d4 | Daniel de Kok | 05 December 2010, 16:59:39 UTC | Replace use of red-black trees by an array quicksort. | 05 December 2010, 16:59:39 UTC |
| 3f12c32 | Daniel de Kok | 22 November 2010, 14:18:14 UTC | Updated features description. | 22 November 2010, 14:18:14 UTC |
| 309008c | Daniel de Kok | 22 November 2010, 13:56:16 UTC | Print l1 norm coefficient differently. | 22 November 2010, 13:56:16 UTC |
| 8827091 | Daniel de Kok | 22 November 2010, 13:54:22 UTC | Modify stopping condition for grafting-light. | 22 November 2010, 13:54:22 UTC |
| 08988f2 | Daniel de Kok | 22 November 2010, 13:41:29 UTC | Use a bit vector to register selected feature, rather than an RB tree. | 22 November 2010, 13:41:29 UTC |
| 621b5f5 | Daniel de Kok | 22 November 2010, 10:26:56 UTC | Improve output to stderr, so we can easily get selected features. | 22 November 2010, 10:26:56 UTC |
| f65bc5e | Daniel de Kok | 19 November 2010, 16:42:30 UTC | Beauify code. | 19 November 2010, 16:42:30 UTC |
| 014bd80 | Daniel de Kok | 19 November 2010, 13:57:36 UTC | Grafting enhancements and fixes: - No optimization during selection. - Initial grafting-light implementation. | 19 November 2010, 13:57:36 UTC |
| 68de302 | Daniel de Kok | 17 November 2010, 11:01:33 UTC | Stop when no features could be selected at all. This replaces the previous criterion, where we stopped when a feature with a zero weight was encountered. | 17 November 2010, 11:01:33 UTC |
| ec0d8fb | Daniel de Kok | 16 November 2010, 15:42:33 UTC | LL -> -LL. | 16 November 2010, 15:42:33 UTC |
| 90590e0 | Daniel de Kok | 16 November 2010, 15:03:02 UTC | Best-N grafting. | 16 November 2010, 15:03:02 UTC |
| ce1d673 | Daniel de Kok | 16 November 2010, 12:54:40 UTC | rbtree license notice. | 16 November 2010, 12:54:40 UTC |
| c30570b | Daniel de Kok | 16 November 2010, 12:50:58 UTC | Very experimental support for grafting. | 16 November 2010, 12:51:17 UTC |
| 28b2cb0 | Daniel de Kok | 12 November 2010, 14:35:42 UTC | Add support for an l1 prior. | 12 November 2010, 14:35:42 UTC |
| fdc7b4e | Daniel de Kok | 02 November 2010, 14:55:06 UTC | Decompress gzip files/streams. | 02 November 2010, 14:55:06 UTC |
| 5eb1acf | Daniel de Kok | 29 October 2010, 07:49:10 UTC | Describe 'linesearch' option. | 29 October 2010, 07:49:10 UTC |
| 4227995 | Daniel de Kok | 28 October 2010, 15:09:26 UTC | Initial TinyEst repository. | 28 October 2010, 15:09:26 UTC |
