Zobrazeno 1 - 10
of 2 531
pro vyhledávání: '"A, Billè"'
The weighted ancestor problem on a rooted node-weighted tree $T$ is a generalization of the classic predecessor problem: construct a data structure for a set of integers that supports fast predecessor queries. Both problems are known to require $\Ome
Externí odkaz:
http://arxiv.org/abs/2311.15777
Autor:
Pham, Vi Thanh, Nielsen, Jonas Bille, Kofoed, Klaus Fuglsang, Kühl, Jørgen Tobias, Jensen, Andreas Kryger
The joint alignment of multivariate functional data plays an important role in various fields such as signal processing, neuroscience and medicine, including the statistical analysis of data from wearable devices. Traditional methods often ignore the
Externí odkaz:
http://arxiv.org/abs/2312.09422
A 'degenerate string' is a sequence of subsets of some alphabet; it represents any string obtainable by selecting one character from each set from left to right. Recently, Alanko et al. generalized the rank-select problem to degenerate strings, where
Externí odkaz:
http://arxiv.org/abs/2310.19702
We revisit the popular \emph{delayed deterministic finite automaton} (\ddfa{}) compression algorithm introduced by Kumar~et~al.~[SIGCOMM 2006] for compressing deterministic finite automata (DFAs) used in intrusion detection systems. This compression
Externí odkaz:
http://arxiv.org/abs/2306.12771
We analyse the numbers of closed paths of length $k\in\mathbb{N}$ on two important regular lattices: the hexagonal lattice (also called $\textit{graphene}$ in chemistry) and its dual triangular lattice. These numbers form a moment sequence of specifi
Externí odkaz:
http://arxiv.org/abs/2306.01462
Autor:
Fainozzi, Danny, Ippoliti, Matteo, Billè, Fulvio, De Angelis, Dario, Foglia, Laura, Masciovecchio, Claudio, Mincigrucci, Riccardo, Pancaldi, Matteo, Pedersoli, Emanuele, Gunther, Christian M., Pfau, Bastian, Schneider, Michael, Schmising, Clemens Von Korff, Eisebitt, Stefan, Kourousias, George, Bencivenga, Filippo, Capotondi, Flavio
The possibility to obtain a three-dimensional representation of a single object with sub-$\mu$m resolution is crucial in many fields, from material science to clinical diagnostics. This is typically achieved through tomography, which combines multipl
Externí odkaz:
http://arxiv.org/abs/2303.18166
Autor:
Bille, Philip, Fischer, Johannes, Gørtz, Inge Li, Pedersen, Max Rishøj, Stordalen, Tord Joakim
Given a string $S$ over an alphabet $\Sigma$, the 'string indexing problem' is to preprocess $S$ to subsequently support efficient pattern matching queries, i.e., given a pattern string $P$ report all the occurrences of $P$ in $S$. In this paper we s
Externí odkaz:
http://arxiv.org/abs/2301.09477
Autor:
Bille, Philip, Gørtz, Inge Li, Lewenstein, Moshe, Pissis, Solon P., Rotenberg, Eva, Steiner, Teresa Anna
In Gapped String Indexing, the goal is to compactly represent a string $S$ of length $n$ such that for any query consisting of two strings $P_1$ and $P_2$, called patterns, and an integer interval $[\alpha, \beta]$, called gap range, we can quickly f
Externí odkaz:
http://arxiv.org/abs/2211.16860
Relative Lempel-Ziv (RLZ) parsing is a dictionary compression method in which a string $S$ is compressed relative to a second string $R$ (called the reference) by parsing $S$ into a sequence of substrings that occur in $R$. RLZ is particularly effect
Externí odkaz:
http://arxiv.org/abs/2208.11371
Let $S$ be a string of length $n$ over an alphabet $\Sigma$ and let $Q$ be a subset of $\Sigma$ of size $q \geq 2$. The 'co-occurrence problem' is to construct a compact data structure that supports the following query: given an integer $w$ return th
Externí odkaz:
http://arxiv.org/abs/2206.10383