Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Skjoldjensen, Frederik Rye"'
We consider the classic partial sums problem on the ultra-wide word RAM model of computation. This model extends the classic $w$-bit word RAM model with special ultrawords of length $w^2$ bits that support standard arithmetic and boolean operation an
Externí odkaz:
http://arxiv.org/abs/1908.10159
We consider the well-studied partial sums problem in succint space where one is to maintain an array of n k-bit integers subject to updates such that partial sums queries can be efficiently answered. We present two succint versions of the Fenwick Tre
Externí odkaz:
http://arxiv.org/abs/1705.10987
Given a string $S$ of length $n$, the classic string indexing problem is to preprocess $S$ into a compact data structure that supports efficient subsequent pattern queries. In the \emph{deterministic} variant the goal is to solve the string indexing
Externí odkaz:
http://arxiv.org/abs/1612.01748
Let $S$ be a string of length $n$ with characters from an alphabet of size $\sigma$. The \emph{subsequence automaton} of $S$ (often called the \emph{directed acyclic subsequence graph}) is the minimal deterministic finite automaton accepting all subs
Externí odkaz:
http://arxiv.org/abs/1510.08748
Autor:
Bille, Philip, Cording, Patrick Hagge, Gørtz, Inge Li, Skjoldjensen, Frederik Rye, Vildhøj, Hjalte Wedel, Vind, Søren
Given a static reference string $R$ and a source string $S$, a relative compression of $S$ with respect to $R$ is an encoding of $S$ as a sequence of references to substrings of $R$. Relative compression schemes are a classic model of compression and
Externí odkaz:
http://arxiv.org/abs/1504.07851
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Skjoldjensen, Frederik Rye
Publikováno v:
Skjoldjensen, F R 2017, Matching and Compression of Strings with Automata and Word Packing . DTU Compute PHD-2017, vol. 446, DTU Compute .
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation Given a static reference string R and a source string S, a relative compression of S with respect to R is an encoding of S as a sequence of references to substrings of R.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1202::afa25c6d72e3856d856f300776915575
http://orbit.dtu.dk/ws/files/140838339/phd446_Skjoldjensen_FR.pdf
http://orbit.dtu.dk/ws/files/140838339/phd446_Skjoldjensen_FR.pdf
Publikováno v:
Bille, P, Gørtz, I L & Skjoldjensen, F R 2016, Subsequence Automata with Default Transitions . in SOFSEM 2016: Theory and Practice of Computer Science : 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings . vol. 9587, Springer, Lecture Notes in Computer Science, pp. 208-216, 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, 23/01/2016 . https://doi.org/10.1007/978-3-662-49192-8_17
Let S be a string of length n with characters from an alphabet of size σ. The subsequence automaton of S (often called the directed acyclic subsequence graph) is the minimal deterministic finite automaton accepting all subsequences of S. A straightf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1202::4765bfe65bf6e43f084e8d0ac9af7635
https://orbit.dtu.dk/en/publications/8f783fbc-cf72-42ce-a846-1fd994848ef0
https://orbit.dtu.dk/en/publications/8f783fbc-cf72-42ce-a846-1fd994848ef0
Publikováno v:
Journal of Discrete Algorithms; May2017, Vol. 44, p48-55, 8p