“Structure methods for image and signal analysis” course at our CS department is getting nicer and nicer. Last week we have Vladimir Kolmogorov invited, talking about techniques for energy minimization in complex graphical models. This week Victor Limpitsky will give a talk named “Image Segmentation: beyond Graph Cuts”. Btw, if you are interested in this course, slides from all the lectures are available here (unfortunately, in Russian language only).
Funny observation: it seems that Vladimir hadn’t been giving math talks in Russian for a quite long time. His Russian is still perfect, but he doesn’t remember even Russian equivalent for “limit point” or “real number”. He asked people who was sitting in front of him to translate various math words from English into Russian during the whole talk.
Btw, have you heard about Logicomix? It’s a comic book about Bertrand Russell, famous logician and mathematician. It covers a lot of interesting stuff including introduction to intuitionism and formalism, Russell’s connections with Kurt Gödel, Henri Poincaré, David Hilbert and other legends of mathematics. And all that great stuff is available in a nice form of a comic book, both online and in hardcover.
Currently there is an interesting problem at the TopCoder Marathon Match. Given a set of 2D points, your task is to enclose all the points with at most M circles and to minimize the total area of all the circles used. Apparently, this problem has no straightforward optimal solution, so various discrete optimization techniques have to be involved. We’ve tried evolutionary optimization yesterday, but we haven’t succeeded yet. More good ideas need to be involved =)