On Mon, Oct 29, 2012 at 11:10 AM, Alexandre Gramfort <[email protected]> wrote: > DTW in O(n^2) is super easy to implement. A good exercise with cython ! > Some implementations exist in O(n) although they give only good > approximations.
Also see: https://github.com/scikit-image/scikit-image/blob/master/skimage/graph/spath.py https://github.com/scikit-image/scikit-image/blob/master/skimage/graph/mcp.py http://docs.scipy.org/doc/scipy/reference/generated/scipy.sparse.csgraph.shortest_path.html#scipy.sparse.csgraph.shortest_path Stéfan ------------------------------------------------------------------------------ The Windows 8 Center - In partnership with Sourceforge Your idea - your app - 30 days. Get started! http://windows8center.sourceforge.net/ what-html-developers-need-to-know-about-coding-windows-8-metro-style-apps/ _______________________________________________ Scikit-learn-general mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
