Zobrazeno 1 - 10
of 2 116
pro vyhledávání: '"Köppl, A."'
Autor:
Köppl, Dominik
Publikováno v:
full version of conference paper published at DCC 2024
We propose algorithms computing the semi-greedy Lempel-Ziv 78 (LZ78), the Lempel-Ziv Double (LZD), and the Lempel-Ziv-Miller-Wegman (LZMW) factorizations in linear time for integer alphabets. For LZD and LZMW, we additionally propose data structures
Externí odkaz:
http://arxiv.org/abs/2409.14649
We prove the Gibbs variational principle for the Asakura--Oosawa model in which particles of random size obey a hardcore constraint of non-overlap and are additionally subject to a temperature-dependent area interaction. The particle size is unbounde
Externí odkaz:
http://arxiv.org/abs/2408.17170
Recent advances in measuring hardness-wise properties of data guide language models in sample selection within low-resource scenarios. However, class-specific properties are overlooked for task setup and learning. How will these properties influence
Externí odkaz:
http://arxiv.org/abs/2407.12512
Autor:
Cai, Fengyu, Zhao, Xinran, Chen, Tong, Chen, Sihao, Zhang, Hongming, Gurevych, Iryna, Koeppl, Heinz
Recent studies show the growing significance of document retrieval in the generation of LLMs, i.e., RAG, within the scientific domain by bridging their knowledge gap. However, dense retrievers often struggle with domain-specific retrieval and complex
Externí odkaz:
http://arxiv.org/abs/2407.10691
We investigate properties of the bijective Burrows-Wheeler transform (BBWT). We show that for any string $w$, a bidirectional macro scheme of size $O(r_B)$ can be induced from the BBWT of $w$, where $r_B$ is the number of maximal character runs in th
Externí odkaz:
http://arxiv.org/abs/2406.16475
To study later spatial evolutionary games based on the multitype contact process, we first focus in this paper on the conditions for survival/extinction in the presence of only one strategy, in which case our model consists of a variant of the contac
Externí odkaz:
http://arxiv.org/abs/2404.09944
Autor:
Azem, Sharif, Scheunert, David, Li, Mengguang, Gehrunger, Jonas, Cui, Kai, Hochberger, Christian, Koeppl, Heinz
The advent of unmanned aerial vehicles (UAVs) has improved a variety of fields by providing a versatile, cost-effective and accessible platform for implementing state-of-the-art algorithms. To accomplish a broader range of tasks, there is a growing n
Externí odkaz:
http://arxiv.org/abs/2403.18703
The mutual information (MI) of Poisson-type channels has been linked to a filtering problem since the 70s, but its evaluation for specific continuous-time, discrete-state systems remains a demanding task. As an advantage, Markov renewal processes (Mr
Externí odkaz:
http://arxiv.org/abs/2403.15221
Indexing a set of strings for prefix search or membership queries is a fundamental task with many applications such as information retrieval or database systems. A classic abstract data type for modelling such an index is a trie. Due to the fundament
Externí odkaz:
http://arxiv.org/abs/2403.04951
Lyndon words are extensively studied in combinatorics on words -- they play a crucial role on upper bounding the number of runs a word can have [Bannai+, SIAM J. Comput.'17]. We can determine Lyndon words, factorize a word into Lyndon words in lexico
Externí odkaz:
http://arxiv.org/abs/2403.02636