I have published the Java executable for the TreeBoost algorithm (originally presented at SPIRE 2006). Better late than never
Father, forgive them, for they do not know what they are coding. (Andrea 23:34)
This Quora question got a number of interesting answers, these are some points I liked most: Continue reading
I have found myself writing a program the needs getting at hand a whole range of binomial coefficients from C(0,0) to C(n,m) for some given values of n and m.
In this case the most efficient way to get them is by using the Pascal’s triangle (triangolo di Tartaglia, in Italy).
I wrote this java class that implements it, with a few optimizations to avoid storing obvious values.
Each coefficient is stored as a BigInteger.