Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Moser, Georg"'
In this paper, we present an innovative iterative approach to rule learning specifically designed for (but not limited to) text-based data. Our method focuses on progressively expanding the vocabulary utilized in each iteration resulting in a signifi
Externí odkaz:
http://arxiv.org/abs/2411.00049
Autor:
Frontull, Samuel, Moser, Georg
This paper explores the impact of different back-translation approaches on machine translation for Ladin, specifically the Val Badia variant. Given the limited amount of parallel data available for this language (only 18k Ladin-Italian sentence pairs
Externí odkaz:
http://arxiv.org/abs/2407.08819
In this paper, we study quantitative properties of quantum programs. Properties of interest include (positive) almost-sure termination, expected runtime or expected cost, that is, for example, the expected number of applications of a given quantum ga
Externí odkaz:
http://arxiv.org/abs/2312.13657
State-of-the-art results in typical classification tasks are mostly achieved by unexplainable machine learning methods, like deep neural networks, for instance. Contrarily, in this paper, we investigate the application of rule learning methods in suc
Externí odkaz:
http://arxiv.org/abs/2311.07323
In this work, we study the fully automated inference of expected result values of probabilistic programs in the presence of natural programming constructs such as procedures, local variables and recursion. While crucial, capturing these constructs be
Externí odkaz:
http://arxiv.org/abs/2304.01284
In this paper, we present a modular methodology that combines state-of-the-art methods in (stochastic) machine learning with traditional methods in rule learning to provide efficient and scalable algorithms for the classification of vast data sets, w
Externí odkaz:
http://arxiv.org/abs/2212.12335
In this paper, we present the first fully-automated expected amortised cost analysis of self-adjusting data structures, that is, of randomised splay trees, randomised splay heaps and randomised meldable heaps, which so far have only (semi-) manually
Externí odkaz:
http://arxiv.org/abs/2206.03537
We introduce a new kind of expectation transformer for a mixed classical-quantum programming language. Our semantic approach relies on a new notion of a cost structure, which we introduce and which can be seen as a specialisation of the Kegelspitzen
Externí odkaz:
http://arxiv.org/abs/2201.09361
We introduce a novel amortised resource analysis couched in a type-and-effect system. Our analysis is formulated in terms of the physicist's method of amortised analysis, and is potential-based. The type system makes use of logarithmic potential func
Externí odkaz:
http://arxiv.org/abs/2101.12029
Autor:
Winkler, Sarah, Moser, Georg
Logically constrained rewrite systems (LCTRSs) are a versatile and efficient rewriting formalism that can be used to model programs from various programming paradigms, as well as simplification systems in compilers and SMT solvers. In this paper, we
Externí odkaz:
http://arxiv.org/abs/2012.06370