[Scipy-tickets] [SciPy] #999: Fast (O(n log(n)) ) implementation of Kendall's Tau

SciPy Trac scipy-tickets@scipy....
Sat Nov 13 22:08:12 CST 2010


#999: Fast (O(n log(n)) ) implementation of Kendall's Tau
-------------------------+--------------------------------------------------
 Reporter:  enzo         |       Owner:  somebody    
     Type:  enhancement  |      Status:  needs_review
 Priority:  normal       |   Milestone:  0.9.0       
Component:  scipy.stats  |     Version:  0.7.0       
 Keywords:  kendall tau  |  
-------------------------+--------------------------------------------------

Comment(by josefpktd):

 I exchanged some private emails with Enzo in June. He had contacted the
 authors of the Java version, and asked them about the licensing in BSD,
 but the reply (in Italien) wasn't very explicit (and with European
 understatement). Either "no problem" or "Well, if you haven't exactly
 copied the code line by line it is no big problem because the algorithm is
 not ours."
 That's why I started to compare the implementation and the paper.

 I would also prefer a more straight forward license issue, and a faster
 implementation would be better, but then we have to wait for a C-binding
 or cython expert.

-- 
Ticket URL: <http://projects.scipy.org/scipy/ticket/999#comment:10>
SciPy <http://www.scipy.org>
SciPy is open-source software for mathematics, science, and engineering.


More information about the Scipy-tickets mailing list