[<<][haskell][>>][..]
Tue Aug 14 19:12:31 EDT 2018

Periodicity detection

[(2,0),(120,1),(1680,0),(120,1),(1680,0),(120,1),(1680,0),(120,1),(1680,0),(120,1),(678,0)]
[(1,0),(1,1),(119,0),(1,1),(119,0),(1,1),(119,0),(1,1),(119,0),(1,1),(18,0)]
[(2,0),(1,1),(1799,0),(1,1),(1799,0),(1,1),(1799,0),(1,1),(1799,0),(1,1),(797,0)]

Problem is preamble and postable.  How to get rid of them?  With a
large enough sample, taking a histogram should make it easy to find
the a good range.

Is there a way to do this without a lot of decisions?




[Reply][About]
[<<][haskell][>>][..]