Daniel Prusa

Orcid: 0000-0003-4866-5709

According to our database1, Daniel Prusa authored at least 56 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SCOD: From Heuristics to Theory.
Proceedings of the Computer Vision - ECCV 2024, 2024

2023
Weight-reducing Turing machines.
Inf. Comput., June, 2023

Optimal Strategies for Reject Option Classifiers.
J. Mach. Learn. Res., 2023

Two-Dimensional Rank-Reducing Grammars and Their Complexity.
J. Autom. Lang. Comb., 2023

Reject option models comprising out-of-distribution detection.
CoRR, 2023

One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars.
Proceedings of the 23rd Conference Information Technologies, 2023

2022
Converting nondeterministic two-way automata into small deterministic linear-time machines.
Inf. Comput., 2022

Consistent and Tractable Algorithm for Markov Network Learning.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars.
Proceedings of the 22nd Conference Information Technologies, 2022

2021
Two-dimensional pattern matching against local and regular-like picture languages.
Theor. Comput. Sci., 2021

Preface.
Fundam. Informaticae, 2021

On Separations of LR(0)-Grammars by Two Types of Pumping Patterns.
Proceedings of the 21st Conference Information Technologies, 2021

2020
Solvers for Mathematical Word Problems in Czech.
Proceedings of the 20th Conference Information Technologies, 2020

Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020

Complexity of Two-Dimensional Rank-Reducing Grammars.
Proceedings of the Descriptional Complexity of Formal Systems, 2020

Relative Interior Rule in Block-Coordinate Descent.
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

2019
Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program.
SIAM J. Optim., 2019

Relative Interior Rule in Block-Coordinate Minimization.
CoRR, 2019

Two-Dimensional Pattern Matching Against Basic Picture Languages.
Proceedings of the Implementation and Application of Automata, 2019

A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs.
Proceedings of the Implementation and Application of Automata, 2019

On discriminative learning of prediction uncertainty.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Dynamics of the Independence Number and Automata Synchronization.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017
Undecidability of the emptiness problem for context-free picture languages.
Theor. Comput. Sci., 2017

LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program.
IEEE Trans. Pattern Anal. Mach. Intell., 2017

Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton.
Int. J. Found. Comput. Sci., 2017

LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Template-Based Pattern Matching in Two-Dimensional Arrays.
Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

Rank-Reducing Two-Dimensional Grammars for Document Layout Analysis.
Proceedings of the 14th IAPR International Conference on Document Analysis and Recognition, 2017

2016
Non-recursive trade-offs between two-dimensional automata and grammars.
Theor. Comput. Sci., 2016

Some classes of rational functions for pictures.
RAIRO Theor. Informatics Appl., 2016

Online recognition of sketched arrow-connected diagrams.
Int. J. Document Anal. Recognit., 2016

Complexity of Sets of Two-Dimensional Patterns.
Proceedings of the Implementation and Application of Automata, 2016

Recognizing Off-Line Flowcharts by Reconstructing Strokes and Using On-Line Recognition Techniques.
Proceedings of the 15th International Conference on Frontiers in Handwriting Recognition, 2016

2015
Universality of the Local Marginal Polytope.
IEEE Trans. Pattern Anal. Mach. Intell., 2015

(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars.
Proceedings of the Implementation and Application of Automata, 2015

Detection of Arrows in On-Line Sketched Diagrams Using Relative Stroke Positioning.
Proceedings of the 2015 IEEE Winter Conference on Applications of Computer Vision, 2015

On a class of rational functions for pictures.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

Graph-based simplex method for pairwise energy minimization with binary variables.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2015

2014
Two-dimensional Sgraffito automata.
RAIRO Theor. Informatics Appl., 2014

Polygonal Models for Clothing.
Proceedings of the Advances in Autonomous Robotics Systems - 15th Annual Conference, 2014

Weight-Reducing Hennie Machines and Their Descriptional Complexity.
Proceedings of the Language and Automata Theory and Applications, 2014

Garment perception and its folding using a dual-arm robot.
Proceedings of the 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2014

Recognition System for On-Line Sketched Diagrams.
Proceedings of the 14th International Conference on Frontiers in Handwriting Recognition, 2014

How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2014

2013
Restarting Tiling Automata.
Int. J. Found. Comput. Sci., 2013

Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata.
Proceedings of the Implementation and Application of Automata, 2013

Modeling Flowchart Structure Recognition as a Max-Sum Problem.
Proceedings of the 12th International Conference on Document Analysis and Recognition, 2013

New Results on Deterministic Sgraffito Automata.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
MfrDB: Database of Annotated On-Line Mathematical Formulae.
Proceedings of the 2012 International Conference on Frontiers in Handwriting Recognition, 2012

Two-Dimensional Sgraffito Automata.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Web application for recognition of mathematical formulas.
Proceedings of the Conference on Theory and Practice of Information Technologies, 2011

2008
Generic framework for integration of programming languages into netbeans ide.
Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, 2008

Structural Construction for On-Line Mathematical Formulae Recognition.
Proceedings of the Progress in Pattern Recognition, 2008

2007
Mathematical Formulae Recognition Using 2D Grammars.
Proceedings of the 9th International Conference on Document Analysis and Recognition (ICDAR 2007), 2007

2006
2D context-free grammars: Mathematical formulae recognition.
Proceedings of the Prague Stringology Conference, 2006


  Loading...