On Mon, May 16, 2011 at 10:03:09AM -0700, Hoyt Koepke wrote:
I might go that way: I already have pure-Python code that implements it
and that I have been using for a year or so.
Fair enough -- though you'd probably get a big speed up moving to cython.
Indeed. If this is needed, we'll
Well, the hungarian algorithm has a theoretical upper bound of O(n^3),
with n being the number of nodes, which is pretty much the best you
can do if you have a dense graph and make no assumptions on
capacities.
OK, your input is making my motivation to fight with Jonker-Volgenant go
down.
On Tue, May 17, 2011 at 09:36:40AM -0700, Hoyt Koepke wrote:
OK, your input is making my motivation to fight with Jonker-Volgenant go
down. I'll see with the other people involved if we still target
Jonger-Volgenant, or if we stick with the hungarian algorithm, in which
case the problem is
On Tue, May 17, 2011 at 12:49 PM, Gael Varoquaux
gael.varoqu...@normalesup.org wrote:
On Tue, May 17, 2011 at 09:36:40AM -0700, Hoyt Koepke wrote:
OK, your input is making my motivation to fight with Jonker-Volgenant
go
down. I'll see with the other people involved if we still target
On Tue, May 17, 2011 at 12:55:39PM -0500, Benjamin Root wrote:
Is this hungarian method in an official scikits package, or is this just
your own thing?
Right now we are playing with the idea of integrating it in the scikits
learn, as it would be useful in a couple of places. I don't know
Following a suggestion by Joseph, I am trying to implement the
Jonker-Volgenant algorithm for best linear assignment in Python, using
numpy. Unsuprisingly, it is proving time-costly. I cannot afford to spend
too much time on this, as it not to solve a problem of mine, but for the
scikits.learn.
On Mon, May 16, 2011 at 1:18 AM, Gael Varoquaux
gael.varoqu...@normalesup.org wrote:
Following a suggestion by Joseph, I am trying to implement the
Jonker-Volgenant algorithm for best linear assignment in Python, using
numpy. Unsuprisingly, it is proving time-costly. I cannot afford to spend
On Mon, May 16, 2011 at 8:53 AM, Charles R Harris
charlesr.har...@gmail.com wrote:
On Mon, May 16, 2011 at 1:18 AM, Gael Varoquaux
gael.varoqu...@normalesup.org wrote:
Following a suggestion by Joseph, I am trying to implement the
Jonker-Volgenant algorithm for best linear assignment in
On Mon, May 16, 2011 at 7:07 AM, josef.p...@gmail.com wrote:
On Mon, May 16, 2011 at 8:53 AM, Charles R Harris
charlesr.har...@gmail.com wrote:
On Mon, May 16, 2011 at 1:18 AM, Gael Varoquaux
gael.varoqu...@normalesup.org wrote:
Following a suggestion by Joseph, I am trying to
On Mon, May 16, 2011 at 12:18 AM, Gael Varoquaux
gael.varoqu...@normalesup.org wrote:
Following a suggestion by Joseph, I am trying to implement the
Jonker-Volgenant algorithm for best linear assignment in Python, using
numpy. Unsuprisingly, it is proving time-costly. I cannot afford to spend
Hey
On Mon, May 16, 2011 at 08:49:58AM -0700, Hoyt Koepke wrote:
On Mon, May 16, 2011 at 12:18 AM, Gael Varoquaux
gael.varoqu...@normalesup.org wrote:
Jonker-Volgenant algorithm for best linear assignment in Python, using
numpy. Unsuprisingly, it is proving time-costly. I cannot afford to
In this case, lemon exists only as C++ header files, with no compiled
code. A few cython functions should make it pretty simple. However,
yeah, it is a bit heavyweight.
Thanks for the suggestion. Unfortunately, I do not want to add compiled
code (or an external dependency) to the scikit for
On Mon, May 16, 2011 at 09:15:21AM -0700, Hoyt Koepke wrote:
Thanks for the suggestion. Unfortunately, I do not want to add compiled
code (or an external dependency) to the scikit for this solver, as it is
a fairly minor step for us. I particular chances are that it will never
be a
I might go that way: I already have pure-Python code that implements it
and that I have been using for a year or so.
Fair enough -- though you'd probably get a big speed up moving to cython.
It's a little slower on large graphs, but it still is pretty quick.
Can you put any numbers on the
14 matches
Mail list logo
