Related papers: Space-efficient RLZ-to-LZ77 conversion
The paper proposes an improved error-resilient Lempel-Ziv'77 (LZ'77) algorithm employing an adaptive amount of parity bits for error protection. It is a modified version of error resilient algorithm LZRS'77, proposed recently, which uses a…
Large Language Models (LLMs) for complex reasoning is often hindered by high computational costs and latency, while resource-efficient Small Language Models (SLMs) typically lack the necessary reasoning capacity. Existing collaborative…
Large Language Models (LLMs) have emerged as powerful tools for generating coherent text, understanding context, and performing reasoning tasks. However, they struggle with temporal reasoning, which requires processing time-related…
We explore space improvements in LRP, a polymorphically typed call-by-need functional core language. A relaxed space measure is chosen for the maximal size usage during an evaluation. It abstracts from the details of the implementation via…
Transferring high-level knowledge from a source task to a target task is an effective way to expedite reinforcement learning (RL). For example, propositional logic and first-order logic have been used as representations of such knowledge.…
In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size, and allows fast access to individual characters of s. This type of structures was investigated…
This paper describes a Relevance-Zone pattern table (RZT) that can be used to replace a traditional transposition table. An RZT stores exact game values for patterns that are discovered during a Relevance-Zone-Based Search (RZS), which is…
Text-to-speech synthesis (TTS) has witnessed rapid progress in recent years, where neural methods became capable of producing audios with high naturalness. However, these efforts still suffer from two types of latencies: (a) the {\em…
In this paper, Lorentz Transformation(LT) is derived by an alternate method, using photon clocks, placed at the locations of the concerned events, which are initially synchronised using a light signal(Einstein synchrony). Then, it is shown…
The Effective Field Theory of Large Scale Structure (EFTofLSS) has found tremendous success as a perturbative framework for the evolution of large scale structure, and it is now routinely used to compare theoretical predictions against…
In this paper we introduce concepts from relativity and geometric algebra to aeroacoustics. We do this using an acoustic space-time transformation within the framework of sound propagation in uniform flows. By using Geometric Algebra we are…
Based on the Breslauer-Italiano online suffix tree construction algorithm (2013) with double logarithmic worst-case guarantees on the update time per letter, we develop near-real-time algorithms for several classical problems on strings,…
We characterize interpolating sequences for pairs of reproducing kernels $(s, \ell)$, where $s$ is a complete Pick factor of $\ell.$ This answers a question of Aleman, Hartz, McCarthy and Richter.
We consider transformations between uniformly accelerated systems, assuming that the Clock Hypothesis is false. We use the proper velocity-time description of events rather than the usual space-time description in order to obtain linear…
The Sliding Window Lempel-Ziv (SWLZ) algorithm has been studied from various perspectives in information theory literature. In this paper, we provide a general law which defines the asymptotics of match length for stationary and ergodic…
We introduce a simple approach that uses a large language model (LLM) to automatically implement a fully interpretable rule-based data-to-text system in pure Python. Experimental evaluation on the WebNLG dataset showed that such a…
Given a pattern $P$ and a text $T$, both strings over a binary alphabet, the binary jumbled string matching problem consists in telling whether any permutation of $P$ occurs in $T$. The indexed version of this problem, i.e., preprocessing a…
Let $X$ be a non-compact symmetric space of dimension $n$. We prove that if $f\in L^{p}(X)$, $1\leq p\leq 2$, then the Riesz means $S_{R}^{z}\left( f\right)$ converge to $f$ almost everywhere as $R\rightarrow \infty $, whenever…
An efficient procedure for the computation of $Li_{s}(z)$ where $s<0$ is here presented. We started with Polylogarithm $Li_{s}(z)$ where $s<0$. The summation of $n^{s}z^{n}$ is evaluated using a new method. An assumption is made that the…
Strong convergence and convergence in probability were generalized to the setting of a Riesz space with conditional expectation operator, $T$, in [{{\sc Y. Azouzi, W.-C. Kuo, K. Ramdane, B. A. Watson}, {Convergence in Riesz spaces with…