E-LIB Suche - Ergebnisse für: Průša, Daniel

1

Weight-reducing Turing machines:

Guillon, Bruno ; Pighizzini, Giovanni ; Prigioniero, Luca.
Information and Computation. 292 (2023) - p. 105030 , 2023

Link: https://doi.org/10.1016/..

2

Consistent and Tractable Algorithm for Markov Network Learn..:

, In: Machine Learning and Knowledge Discovery in Databases; Lecture Notes in Computer Science,

Franc, Vojtech ; Prusa, Daniel ; Yermakov, Andrii - p. 435-451 , 2023

Link: https://doi.org/10.1007/..

3

Converting nondeterministic two-way automata into small det..:

Guillon, Bruno ; Pighizzini, Giovanni ; Prigioniero, Luca.
Information and Computation. 289 (2022) - p. 104938 , 2022

Link: https://doi.org/10.1016/..

4

Two-dimensional pattern matching against local and regular-..:

Mráz, František ; Průša, Daniel ; Wehar, Michael
Theoretical Computer Science. 870 (2021) - p. 137-152 , 2021

Link: https://doi.org/10.1016/..

5

Relative Interior Rule in Block-Coordinate Descent:

, In: 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR),

Werner, Tomas ; Prusa, Daniel ; Dlask, Tomas - p. 7556-7564 , 2020

Link: https://doi.org/10.1109/..

6

Complexity of Two-Dimensional Rank-Reducing Grammars:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,

Průša, Daniel - p. 155-166 , 2020

Link: https://doi.org/10.1007/..

7

Complexity of Searching for 2 by 2 Submatrices in Boolean M..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,

Průša, Daniel ; Wehar, Michael - p. 266-279 , 2020

Link: https://doi.org/10.1007/..

8

Two-Dimensional Pattern Matching Against Basic Picture Lang..:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,

Mráz, František ; Průša, Daniel ; Wehar, Michael - p. 209-221 , 2019

Link: https://doi.org/10.1007/..

9

Solving LP Relaxations of Some NP-Hard Problems Is As Hard ..:

Průša, Daniel ; Werner, Tomáš
SIAM Journal on Optimization. 29 (2019) 3 - p. 1745-1771 , 2019

Link: https://doi.org/10.1137/..

10

A Simple Extension to Finite Tree Automata for Defining Set..:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,

Fujiyoshi, Akio ; Průša, Daniel - p. 121-132 , 2019

Link: https://doi.org/10.1007/..

11

Dynamics of the Independence Number and Automata Synchroniz..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,

Gusev, Vladimir V. ; Jungers, Raphaël M. ; Průša, Daniel - p. 379-391 , 2018

Link: https://doi.org/10.1007/..

12

Two-Way Automata and One-Tape Machines: Read Only Versus Li..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,

Guillon, Bruno ; Pighizzini, Giovanni ; Prigioniero, Luca. - p. 366-378 , 2018

Link: https://doi.org/10.1007/..

13

Undecidability of the emptiness problem for context-free pi..:

Průša, Daniel ; Reinhardt, Klaus
Theoretical Computer Science. 679 (2017) - p. 118-125 , 2017

Link: https://doi.org/10.1016/..

14

LP relaxations of some NP-hard problems are as hard as any ..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,

Průša, Daniel ; Werner, Tomáš - p. 1372-1382 , 2017

Link: https://dl.acm.org/doi/1..

15

LP Relaxation of the Potts Labeling Problem Is as Hard as A..:

Prusa, Daniel ; Werner, Tomas
IEEE Transactions on Pattern Analysis and Machine Intelligence. 39 (2017) 7 - p. 1469-1475 , 2017

Link: https://doi.org/10.1109/..