News for hackers. Stuff that matters.
Re:Building a Content-Based Search Engine IV: Earth Mover's ... by cup-of-tea on Sunday April 29, 2018 @04:35PM (#16953799)
It needs the Hungarian algorithm to solve it and it's not the easiest algorithm to implement. In fact, it's by far the hardest algorithm I've implemented (I can't exactly remember why). I wrote it in Common Lisp and worked on the performance quite a bit. It's still an O(n^3) algorithm, though.

There are no comments on this comment yet.