我期待着。 草场-Procaccia算法,载于:NET/C/C++、MATLAB或Java。 当时我一直在寻找,但似乎实际执行情况还没有在任何地方公布,我真的不想执行,因为需要大量测试。
这一算法可以估算时间序列数据的相关层面。 有一些MATLAB代码:here,该编码的确对相关方面进行了计算,但似乎使用其他一些算法。
我的数据为{0,1,2} 字母,是一个非线性信号,每个信号示例大约为10兆赫6点。 我有大约100个样本信号事例,它们是由一些外部特征分类的。 关于这些信号,我需要计算相关层面,然后采用一些统计数据,以了解各群体之间是否存在任何差异。 因此,这一信号就是这样:
Signal1 = 0000000001000020010000001...
Signal2 = 0000001200000200200202000...
Signal3 = 2222220000000220000100011...
任何联系都会受到高度赞赏。 感谢!
If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...
I m using Electro in Lua for some 3D simulations, and I m running in to something of a mathematical/algorithmic/physics snag. I m trying to figure out how I would find the "spin" of a sphere of a ...
There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...
As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...
Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...
I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...
Given an array of integers arr = [5, 6, 1]. When we construct a BST with this input in the same order, we will have "5" as root, "6" as the right child and "1" as left child. Now if our input is ...
I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...