Daniel Prusa

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 37

Top Topics

Picture Languages

Top Venues

Publications

Vojtech Franc, Jakub Paplhám, Daniel Prusa
SCOD: From Heuristics to Theory. CoRR (2024)
Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
Weight-reducing Turing machines. Inf. Comput. 292 (2023)
Vojtech Franc, Daniel Prusa, Václav Vorácek
Optimal Strategies for Reject Option Classifiers. J. Mach. Learn. Res. 24 (2023)
Daniel Prusa
Two-Dimensional Rank-Reducing Grammars and Their Complexity. J. Autom. Lang. Comb. 28 (1-3) (2023)
Vojtech Franc, Daniel Prusa, Jakub Paplhám
Reject option models comprising out-of-distribution detection. CoRR (2023)
Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa
One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars. ITAT (2023)
Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
Converting nondeterministic two-way automata into small deterministic linear-time machines. Inf. Comput. 289 (Part) (2022)
Vojtech Franc, Daniel Prusa, Andrii Yermakov
Consistent and Tractable Algorithm for Markov Network Learning. ECML/PKDD (4) (2022)
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars. ITAT (2022)
Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines. CoRR (2021)
Frantisek Mráz, Daniel Prusa, Michael Wehar
Two-dimensional pattern matching against local and regular-like picture languages. Theor. Comput. Sci. 870 (2021)
Jorma Hirvensalo, Frantisek Mráz, Daniel Prusa
Preface. Fundam. Informaticae 180 (1-2) (2021)
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa, Jirí Síma
On Separations of LR(0)-Grammars by Two Types of Pumping Patterns. ITAT (2021)
Vojtech Franc, Daniel Prusa, V. Voracek
Optimal strategies for reject option classifiers. CoRR (2021)
Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
Weight-Reducing Turing Machines. CoRR (2021)
Tomás Werner, Daniel Prusa, Tomás Dlask
Relative Interior Rule in Block-Coordinate Descent. CVPR (2020)
Daniel Prusa, Michael Wehar
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices. DLT (2020)
Daniel Prusa
Complexity of Two-Dimensional Rank-Reducing Grammars. DCFS (2020)
Jan Kadlec, Daniel Prusa
Solvers for Mathematical Word Problems in Czech. ITAT (2020)
Frantisek Mráz, Daniel Prusa, Michael Wehar
Two-Dimensional Pattern Matching Against Basic Picture Languages. CIAA (2019)
Daniel Prusa, Tomás Werner
Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program. SIAM J. Optim. 29 (3) (2019)
Tomás Werner, Daniel Prusa
Relative Interior Rule in Block-Coordinate Minimization. CoRR (2019)
Vojtech Franc, Daniel Prusa
On discriminative learning of prediction uncertainty. ICML (2019)
Akio Fujiyoshi, Daniel Prusa
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs. CIAA (2019)
Vladimir V. Gusev, Raphaël M. Jungers, Daniel Prusa
Dynamics of the Independence Number and Automata Synchronization. DLT (2018)
Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. DLT (2018)
Daniel Prusa
Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton. Int. J. Found. Comput. Sci. 28 (5) (2017)
Daniel Prusa, Akio Fujiyoshi
Rank-Reducing Two-Dimensional Grammars for Document Layout Analysis. ICDAR (2017)
Yo-Sub Han, Daniel Prusa
Template-Based Pattern Matching in Two-Dimensional Arrays. IWCIA (2017)
Daniel Prusa, Tomás Werner
LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program. IEEE Trans. Pattern Anal. Mach. Intell. 39 (7) (2017)
Daniel Prusa, Klaus Reinhardt
Undecidability of the emptiness problem for context-free picture languages. Theor. Comput. Sci. 679 (2017)
Daniel Prusa, Tomás Werner
LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP. SODA (2017)
Daniel Prusa
Non-recursive trade-offs between two-dimensional automata and grammars. Theor. Comput. Sci. 610 (2016)
Martin Bresler, Daniel Prusa, Václav Hlavác
Recognizing Off-Line Flowcharts by Reconstructing Strokes and Using On-Line Recognition Techniques. ICFHR (2016)
Frantisek Mráz, Friedrich Otto, Daniel Prusa
Some classes of rational functions for pictures. RAIRO Theor. Informatics Appl. 50 (4) (2016)
Martin Bresler, Daniel Prusa, Václav Hlavác
Online recognition of sketched arrow-connected diagrams. Int. J. Document Anal. Recognit. 19 (3) (2016)
Daniel Prusa
Complexity of Sets of Two-Dimensional Patterns. CIAA (2016)
Daniel Prusa
Graph-based simplex method for pairwise energy minimization with binary variables. CVPR (2015)
Daniel Prusa, Tomás Werner
Universality of the Local Marginal Polytope. IEEE Trans. Pattern Anal. Mach. Intell. 37 (4) (2015)
Daniel Prusa
(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars. CIAA (2015)
Martin Bresler, Daniel Prusa, Václav Hlavác
Detection of Arrows in On-Line Sketched Diagrams Using Relative Stroke Positioning. WACV (2015)
Frantisek Mráz, Friedrich Otto, Daniel Prusa
On a class of rational functions for pictures. NCMA (2015)
Martin Bresler, Truyen Van Phan, Daniel Prusa, Masaki Nakagawa, Václav Hlavác
Recognition System for On-Line Sketched Diagrams. ICFHR (2014)
Jan Stria, Daniel Prusa, Václav Hlavác
Polygonal Models for Clothing. TAROS (2014)
Daniel Prusa
Non-recursive Trade-offs between Two-Dimensional Automata and Grammars. DCFS (2014)
Daniel Prusa
Weight-Reducing Hennie Machines and Their Descriptional Complexity. LATA (2014)
Jan Stria, Daniel Prusa, Václav Hlavác, Libor Wagner, Vladimír Petrík, Pavel Krsek, Vladimír Smutný
Garment perception and its folding using a dual-arm robot. IROS (2014)
Daniel Prusa, Frantisek Mráz, Friedrich Otto
Two-dimensional Sgraffito automata. RAIRO Theor. Informatics Appl. 48 (5) (2014)
Daniel Prusa, Tomás Werner
How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem? EMMCVPR (2014)
Martin Bresler, Daniel Prusa, Václav Hlavác
Modeling Flowchart Structure Recognition as a Max-Sum Problem. ICDAR (2013)
Daniel Prusa, Frantisek Mráz, Friedrich Otto
New Results on Deterministic Sgraffito Automata. Developments in Language Theory (2013)
Daniel Prusa, Tomás Werner
Universality of the Local Marginal Polytope. CVPR (2013)
Daniel Prusa, Frantisek Mráz, Friedrich Otto
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata. CIAA (2013)
Daniel Prusa, Frantisek Mráz
Restarting Tiling Automata. Int. J. Found. Comput. Sci. 24 (6) (2013)
Daniel Prusa, Frantisek Mráz
Two-Dimensional Sgraffito Automata. Developments in Language Theory (2012)
Daniel Prusa, Frantisek Mráz
Restarting Tiling Automata. CIAA (2012)
Jan Stria, Martin Bresler, Daniel Prusa, Václav Hlavác
MfrDB: Database of Annotated On-Line Mathematical Formulae. ICFHR (2012)
Jan Stria, Daniel Prusa
Web application for recognition of mathematical formulas. ITAT (2011)
Jan Jancura, Daniel Prusa
Generic framework for integration of programming languages into netbeans ide. PEPM (2008)
Daniel Prusa, Václav Hlavác
Structural Construction for On-Line Mathematical Formulae Recognition. CIARP (2008)
Daniel Prusa, Václav Hlavác
Mathematical Formulae Recognition Using 2D Grammars. ICDAR (2007)
Daniel Prusa, Václav Hlavác
2D context-free grammars: Mathematical formulae recognition. Stringology (2006)