Daniel Prusa

Center for Machine Perception, Department of Cybernetics,
Faculty of Electrical Engineering, Czech Technical University

Address: Karlovo namesti 13, 121 35, Prague 2, Czech Republic
Room: G105, Phone: +420 22435 5779
e-mail: prusapa1@cmp.felk.cvut.cz


Current Position: Assistant Professor.
Research Interests: Theory of Formal Languages, Computational Complexity, Markov Random Fields, Structural Pattern Recognition.

Education: Ph.D., Faculty of Mathematics and Physics, Charles University in Prague, thesis: Two-dimensional Languages, graduated in June 2005.
MSc., Faculty of Mathematics and Physics, Charles University in Prague, thesis: Parallel Turing Machines on a Two-dimensional Tape (In Czech), graduated in May 1998.

Work Experience: 1999-2010: Sun Microsystems Czech, software engineer, development of NetBeans IDE.
Since 2010: Center for Machine Perception, CTU, research fellow.

Teaching: Theoretical Computer Science [A7B33TIN].
Algorithms [A4B33ALG], Advanced Algorithms [A4M33PAL].
Optimization [A4B33OPT] (labs).

Selected Publications: D. Prusa, T. Werner. How Hard is the LP Relaxation of the Potts Min-Sum Labeling Problem? International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), Lecture Notes in Computer Science, Springer, 2015. To appear.
S. Zivny, T. Werner, D. Prusa. The Power of LP Relaxation for MAP Inference. A chapter in: Advanced Structured Prediction, MIT Press, 2014.
D. Prusa. Weight-Reducing Hennie Machines and Their Descriptional Complexity. International Conference on Language and Automata Theory and Applications (LATA), Lecture Notes in Computer Science, Springer, 2014.
D. Prusa, T. Werner. Universality of the Local Marginal Polytope. Universality of the Local Marginal Polytope. Computer Vision and Pattern Recognition (CVPR) Conf., 2013.
M. Bresler, D. Prusa, V. Hlavac. Modeling Flowchart Structure Recognition as a Max-Sum Problem. International Conference on Document Analysis and Recognition (ICDAR), 2013.
D. Prusa, F. Mraz. Restarting Tiling Automata. International Journal of Foundations of Computer Science, World Scientific, 2013.
D. Prusa, F. Mraz. Two-dimensional Sgraffito Automata. Developments in Language Theory (DLT) Conf., Lecture Notes in Computer Science, Springer, 2012.
D. Prusa, V. Hlavac. Mathematical Formulae Recognition using 2D Grammars. International Conference on Document Analysis and Recognition (ICDAR), 2007.

Full list of publications at DBLP.

  Last Modified: 02-Dec-2014