default search action
Daniel Prusa
Person information
- unicode name: Daniel Průša
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c41]Vojtech Franc
, Jakub Paplhám, Daniel Prusa
SCOD: From Heuristics to Theory. ECCV (84) 2024: 424-441 - [i6]Vojtech Franc, Jakub Paplhám, Daniel Prusa:
SCOD: From Heuristics to Theory. CoRR abs/2403.16916 (2024) - 2023
- [j16]Bruno Guillon
Weight-reducing Turing machines. Inf. Comput. 292: 105030 (2023) - [j15]Daniel Prusa
Two-Dimensional Rank-Reducing Grammars and Their Complexity. J. Autom. Lang. Comb. 28(1-3): 143-166 (2023) - [j14]Vojtech Franc, Daniel Prusa, Václav Vorácek:
Optimal Strategies for Reject Option Classifiers. J. Mach. Learn. Res. 24: 11:1-11:49 (2023) - [c40]Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa:
One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars. ITAT 2023: 110-120 - [i5]Vojtech Franc, Daniel Prusa, Jakub Paplhám:
Reject option models comprising out-of-distribution detection. CoRR abs/2307.05199 (2023) - 2022
- [j13]Bruno Guillon
Converting nondeterministic two-way automata into small deterministic linear-time machines. Inf. Comput. 289(Part): 104938 (2022) - [c39]Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa:
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars. ITAT 2022: 111-121 - [c38]Vojtech Franc
Consistent and Tractable Algorithm for Markov Network Learning. ECML/PKDD (4) 2022: 435-451 - 2021
- [j12]Jorma Hirvensalo, Frantisek Mráz, Daniel Prusa:
Preface. Fundam. Informaticae 180(1-2) (2021) - [j11]Frantisek Mráz
Two-dimensional pattern matching against local and regular-like picture languages. Theor. Comput. Sci. 870: 137-152 (2021) - [c37]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: 140-146 - [i4]Vojtech Franc, Daniel Prusa, Václav Vorácek:
Optimal strategies for reject option classifiers. CoRR abs/2101.12523 (2021) - [i3]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines. CoRR abs/2103.05485 (2021) - [i2]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Weight-Reducing Turing Machines. CoRR abs/2103.05486 (2021) - 2020
- [c36]Tomás Werner, Daniel Prusa
Relative Interior Rule in Block-Coordinate Descent. CVPR 2020: 7556-7564 - [c35]Daniel Prusa
Complexity of Two-Dimensional Rank-Reducing Grammars. DCFS 2020: 155-166 - [c34]Daniel Prusa
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices. DLT 2020: 266-279 - [c33]Jan Kadlec, Daniel Prusa:
Solvers for Mathematical Word Problems in Czech. ITAT 2020: 18-25
2010 – 2019
- 2019
- [j10]Daniel Prusa
Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program. SIAM J. Optim. 29(3): 1745-1771 (2019) - [c32]Vojtech Franc, Daniel Prusa:
On discriminative learning of prediction uncertainty. ICML 2019: 1963-1971 - [c31]Akio Fujiyoshi, Daniel Prusa
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs. CIAA 2019: 121-132 - [c30]Frantisek Mráz
Two-Dimensional Pattern Matching Against Basic Picture Languages. CIAA 2019: 209-221 - [i1]Tomás Werner, Daniel Prusa:
Relative Interior Rule in Block-Coordinate Minimization. CoRR abs/1910.09488 (2019) - 2018
- [c29]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. DLT 2018: 366-378 - [c28]Vladimir V. Gusev
Dynamics of the Independence Number and Automata Synchronization. DLT 2018: 379-391 - 2017
- [j9]Daniel Prusa:
Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton. Int. J. Found. Comput. Sci. 28(5): 623- (2017) - [j8]Daniel Prusa
LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program. IEEE Trans. Pattern Anal. Mach. Intell. 39(7): 1469-1475 (2017) - [j7]Daniel Prusa
Undecidability of the emptiness problem for context-free picture languages. Theor. Comput. Sci. 679: 118-125 (2017) - [c27]Daniel Prusa
Rank-Reducing Two-Dimensional Grammars for Document Layout Analysis. ICDAR 2017: 1120-1125 - [c26]Yo-Sub Han, Daniel Prusa
Template-Based Pattern Matching in Two-Dimensional Arrays. IWCIA 2017: 79-92 - [c25]Daniel Prusa
LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP. SODA 2017: 1372-1382 - [e1]Rudolf Freund, Frantisek Mráz, Daniel Prusa:
Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA 2017, Prague, Czech Republic, August 17-18, 2017. Österreichische Computer Gesellschaft 2017, ISBN 978-3-903035-18-8 [contents] - 2016
- [j6]Martin Bresler, Daniel Prusa
Online recognition of sketched arrow-connected diagrams. Int. J. Document Anal. Recognit. 19(3): 253-267 (2016) - [j5]Frantisek Mráz
Some classes of rational functions for pictures. RAIRO Theor. Informatics Appl. 50(4): 351-369 (2016) - [j4]Daniel Prusa
Non-recursive trade-offs between two-dimensional automata and grammars. Theor. Comput. Sci. 610: 121-132 (2016) - [c24]Martin Bresler, Daniel Prusa
Recognizing Off-Line Flowcharts by Reconstructing Strokes and Using On-Line Recognition Techniques. ICFHR 2016: 48-53 - [c23]Daniel Prusa
Complexity of Sets of Two-Dimensional Patterns. CIAA 2016: 236-247 - 2015
- [j3]Daniel Prusa
Universality of the Local Marginal Polytope. IEEE Trans. Pattern Anal. Mach. Intell. 37(4): 898-904 (2015) - [c22]Daniel Prusa
Graph-based simplex method for pairwise energy minimization with binary variables. CVPR 2015: 475-483 - [c21]Frantisek Mráz, Friedrich Otto, Daniel Prusa:
On a class of rational functions for pictures. NCMA 2015: 159-176 - [c20]Martin Bresler
Detection of Arrows in On-Line Sketched Diagrams Using Relative Stroke Positioning. WACV 2015: 610-617 - [c19]Daniel Prusa
(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars. CIAA 2015: 250-262 - 2014
- [j2]Daniel Prusa
Two-dimensional Sgraffito automata. RAIRO Theor. Informatics Appl. 48(5): 505-539 (2014) - [c18]Daniel Prusa
Non-recursive Trade-offs between Two-Dimensional Automata and Grammars. DCFS 2014: 352-363 - [c17]Daniel Prusa
How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem? EMMCVPR 2014: 57-70 - [c16]Martin Bresler
Recognition System for On-Line Sketched Diagrams. ICFHR 2014: 563-568 - [c15]Jan Stria, Daniel Prusa
Garment perception and its folding using a dual-arm robot. IROS 2014: 61-67 - [c14]Daniel Prusa
Weight-Reducing Hennie Machines and Their Descriptional Complexity. LATA 2014: 553-564 - [c13]Jan Stria, Daniel Prusa
Polygonal Models for Clothing. TAROS 2014: 173-184 - 2013
- [j1]Daniel Prusa
Restarting Tiling Automata. Int. J. Found. Comput. Sci. 24(6): 863-878 (2013) - [c12]Daniel Prusa
Universality of the Local Marginal Polytope. CVPR 2013: 1738-1743 - [c11]Daniel Prusa
New Results on Deterministic Sgraffito Automata. Developments in Language Theory 2013: 409-419 - [c10]Martin Bresler
Modeling Flowchart Structure Recognition as a Max-Sum Problem. ICDAR 2013: 1215-1219 - [c9]Daniel Prusa
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata. CIAA 2013: 268-279 - 2012
- [c8]Daniel Prusa
Two-Dimensional Sgraffito Automata. Developments in Language Theory 2012: 251-262 - [c7]Jan Stria, Martin Bresler
MfrDB: Database of Annotated On-Line Mathematical Formulae. ICFHR 2012: 542-547 - [c6]Daniel Prusa
Restarting Tiling Automata. CIAA 2012: 289-300 - 2011
- [c5]Jan Stria, Daniel Prusa:
Web application for recognition of mathematical formulas. ITAT 2011: 47-54
2000 – 2009
- 2008
- [c4]Daniel Prusa
Structural Construction for On-Line Mathematical Formulae Recognition. CIARP 2008: 317-324 - [c3]Jan Jancura, Daniel Prusa
Generic framework for integration of programming languages into netbeans ide. PEPM 2008: 123-124 - 2007
- [c2]Daniel Prusa
Mathematical Formulae Recognition Using 2D Grammars. ICDAR 2007: 849-853 - 2006
- [c1]Daniel Prusa, Václav Hlavác:
2D context-free grammars: Mathematical formulae recognition. Stringology 2006: 77-89
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: