|
|
Monday, May 5th, 2008
|
4:14p - algorithmic problem
Given a set L of permutations of a list, compute the maximal partial order (DAG) under which all lists in L are topological sorts. How would you do this? Can you do better than O(m n^2 k^2)? (m = number of lists in L, k = # of things in domain = the size of the elements of L)
Sounds like an ILP problem.
One idea: whenever a cycle is detected, all the elements are deemed incomparable.
(17 comments  |comment on this)
|
7:39p - accepted papers
UAI: 32 plenary talks, 40 posters (total 72)
ICML, total: 156
COLT, total: 44
MLG seems interesting too.
4 conferences in one!
(comment on this)
|
|
|
|
![[info]](http://l-stat.livejournal.com/img/userinfo.gif){kind=small}
gustavolacerda's journal