Zobrazeno 1 - 10
of 326
pro vyhledávání: '"Márkus, L."'
Information extraction from textual data, where the query is represented by a finite transducer and the task is to enumerate all results without repetition, and its extension to the weighted case, where each output element has a weight and the output
Externí odkaz:
http://arxiv.org/abs/2409.18563
We present a theoretical framework for the extraction and transformation of text documents. We propose to use a two-phase process where the first phase extracts span-tuples from a document, and the second phase maps the content of the span-tuples int
Externí odkaz:
http://arxiv.org/abs/2405.12350
For two strings u, v over some alphabet A, we investigate the problem of embedding u into w as a subsequence under the presence of generalised gap constraints. A generalised gap constraint is a triple (i, j, C_{i, j}), where 1 <= i < j <= |u| and C_{
Externí odkaz:
http://arxiv.org/abs/2404.10497
Autor:
Lohrey, Markus, Schmid, Markus L.
We present a linear preprocessing and output-linear delay enumeration algorithm for MSO-queries over trees that are compressed in the well-established grammar-based framework. Time bounds are measured with respect to the size of the compressed repres
Externí odkaz:
http://arxiv.org/abs/2403.03067
Autor:
Schmid, Markus L.
The introduction of pattern languages in the seminal work [Angluin, ``Finding Patterns Common to a Set of Strings'', JCSS 1980] has revived the classical model of inductive inference (learning in the limit, gold-style learning). In [Shinohara, ``Poly
Externí odkaz:
http://arxiv.org/abs/2206.13918
We consider subsequences with gap constraints, i.e., length-k subsequences p that can be embedded into a string w such that the induced gaps (i.e., the factors of w between the positions to which p is mapped to) satisfy given gap constraints $gc = (C
Externí odkaz:
http://arxiv.org/abs/2206.13896
Autor:
Trauth, Martin H., Asrat, Asfawossen, Fischer, Markus L., Foerster, Verena, Kaboth-Bahr, Stefanie, Lamb, Henry F., Marwan, Norbert, Roberts, Helen M., Schaebitz, Frank
Publikováno v:
In Quaternary Science Advances September 2024 15
Autor:
Fischer, Markus L., Munz, Philipp M., Asrat, Asfawossen, Foerster, Verena, Kaboth-Bahr, Stefanie, Marwan, Norbert, Schaebitz, Frank, Schwanghart, Wolfgang, Trauth, Martin H.
Publikováno v:
In Quaternary Science Advances June 2024 14
Autor:
Schmid, Markus L., Schweikardt, Nicole
We consider the problem of evaluating regular spanners over compressed documents, i.e., we wish to solve evaluation tasks directly on the compressed data, without decompression. As compressed forms of the documents we use straight-line programs (SLPs
Externí odkaz:
http://arxiv.org/abs/2101.10890
Autor:
Casel, Katrin, Schmid, Markus L.
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (November 27, 2023) lmcs:8625
A regular path query (RPQ) is a regular expression q that returns all node pairs (u, v) from a graph database that are connected by an arbitrary path labelled with a word from L(q). The obvious algorithmic approach to RPQ-evaluation (called PG-approa
Externí odkaz:
http://arxiv.org/abs/2101.01945