On Tue, Aug 20, 2013 at 9:29 PM, Phil Steitz wrote:
>
> But what is returned by the iterator is arrays and there is no
> "arithmetic" going on. One thing I did think of was cutting out the
> binomial coefficients from "ArithmeticUtils" and creating a
> Combinatorics or CombinatoricsUtils class wi
[...]
"ArithmeticUtils" seems appropriate.
But what is returned by the iterator is arrays and there is no
"arithmetic" going on. One thing I did think of was cutting out the
binomial coefficients from "ArithmeticUtils" and creating a
Combinatorics or CombinatoricsUtils class within utils.
Th
On 8/20/13 6:04 PM, Gilles wrote:
> On Tue, 20 Aug 2013 08:51:30 -0700, Phil Steitz wrote:
>> The monte carlo approach I developed for 2-sample Kolmogorov-Smirnov
>> tests converges too slowly to be practical. I suspect full
>> enumeration of n - m partitions of n + m will actually be faster for
>
On Tue, 20 Aug 2013 08:51:30 -0700, Phil Steitz wrote:
The monte carlo approach I developed for 2-sample Kolmogorov-Smirnov
tests converges too slowly to be practical. I suspect full
enumeration of n - m partitions of n + m will actually be faster for
small m + n. To do this, I need to enumerat
I feel like it belongs in a separate class in utils.
-Ajo
On Tue, Aug 20, 2013 at 12:24 PM, Phil Steitz wrote:
> On 8/20/13 12:09 PM, Ajo Fod wrote:
> > I think it belongs in stat.inference. That is where all the tests are.
>
> Sorry, I should have been more clear. I intend to put
> Kolmogoro
On 8/20/13 12:09 PM, Ajo Fod wrote:
> I think it belongs in stat.inference. That is where all the tests are.
Sorry, I should have been more clear. I intend to put
KolmogorovSmirnovTest in stat.inference. I agree it belongs there.
What I am puzzling over is where to put the combinations iterator
I think it belongs in stat.inference. That is where all the tests are.
-Ajo
On Tue, Aug 20, 2013 at 8:51 AM, Phil Steitz wrote:
> The monte carlo approach I developed for 2-sample Kolmogorov-Smirnov
> tests converges too slowly to be practical. I suspect full
> enumeration of n - m partitions
The monte carlo approach I developed for 2-sample Kolmogorov-Smirnov
tests converges too slowly to be practical. I suspect full
enumeration of n - m partitions of n + m will actually be faster for
small m + n. To do this, I need to enumerate combinations. I have
implemented a fast, non-recursive
