相关论文: Space-efficient RLZ-to-LZ77 conversion

Given an array of size $n$ from a total order, we consider the problem of constructing a data structure that supports various queries (range minimum/maximum queries with their variants and next/previous larger/smaller queries) efficiently.…

A calculus based on pointer-mark coincidences is proposed to define, in a mathematically rigorous way, measurements of space and time intervals. The connection between such measurements in different inertial frames according to the Galilean…

The longest common prefix (LCP) array is a versatile auxiliary data structure in indexed string matching. It can be used to speed up searching using the suffix array (SA) and provides an implicit representation of the topology of an…

This paper focuses on planning robot navigation tasks from natural language specifications. We develop a modular approach, where a large language model (LLM) translates the natural language instructions into a linear temporal logic (LTL)…

Scaling large language models (LLMs) has driven significant advancements, yet it faces diminishing returns and escalating energy demands. This work explores how test-time compute (TTC) can serve as an energy-efficient complement to…

We derive compact formulae for modular transformations of WZ characters. We start with algebra A_1 at positive level k=n-2, for which we can easily provide some description of isometry group and genus formula in a special case. We also…

In this paper, we propose to use a set of simple, uniform in architecture LSTM-based models to recover different kinds of temporal relations from text. Using the shortest dependency path between entities as input, the same architecture is…

This paper introduces a novel approach to enhance the capabilities of Large Language Models (LLMs) in processing and understanding extensive text sequences, a critical aspect in applications requiring deep comprehension and synthesis of…

In highly repetitive strings, like collections of genomes from the same species, distinct measures of repetition all grow sublinearly in the length of the text, and indexes targeted to such strings typically depend only on one of these…

This paper shows how to generate code that efficiently converts sparse tensors between disparate storage formats (data layouts) such as CSR, DIA, ELL, and many others. We decompose sparse tensor conversion into three logical phases:…

We show that any permutation of ${1,2,...,N}$ can be written as the product of two involutions. As a consequence, any permutation of the elements of an array can be performed in-place in parallel in time O(1). In the case where the…

Large Language Models (LLMs) have excelled in various tasks but perform better in high-resource scenarios, which presents challenges in low-resource scenarios. Data scarcity and the inherent difficulty of adapting LLMs to specific tasks…

We study an extension problem for continuous linear maps in the setting of $(LB)$-spaces. More precisely, we characterize the pairs $(E,Z)$, where $E$ is a locally complete space with a fundamental sequence of bounded sets and $Z$ is an…

We formulate a parametrized uniformly absolutely globally convergent series of $\zeta$(s) denoted by Z(s, x). When expressed in closed form, it is given by Z(s, x) = (s -- 1)$\zeta$(s) + 1 x Li s z z -- 1 dz, where Li s (x) is the…

Adapting Large Language Models (LLMs) that are extensively trained on abundant text data, and customizing the input prompt to enable time series forecasting has received considerable attention. While recent work has shown great potential…

We propose a novel, lightweight supervised dictionary learning framework for text classification based on data compression and representation. This two-phase algorithm initially employs the Lempel-Ziv-Welch (LZW) algorithm to construct a…

A practical method to compute the Riemann zeta function is presented. The method can compute $\zeta(1/2+it)$ at any $\lfloor T^{1/4} \rfloor$ points in $[T,T+T^{1/4}]$ using an average time of $T^{1/4+o(1)}$ per point. This is the same…

We present a novel parsing algorithm for all context-free languages, based on computing the relation between configurations and reaching transitions in a recursive transition network. Parsing complexity w.r.t. input length matches the state…

The problem of finding factors of a text string which are identical or similar to a given pattern string is a central problem in computer science. A generalised version of this problem consists in implementing an index over the text to…

We give a new treatment of tabular LR parsing, which is an alternative to Tomita's generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive because it uses simpler concepts, such as grammar…