Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Pedersen, Max Rishøj"'
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
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
The classic string indexing problem is to preprocess a string S into a compact data structure that supports efficient pattern matching queries. Typical queries include existential queries (decide if the pattern occurs in S), reporting queries (return
Externí odkaz:
http://arxiv.org/abs/2102.02505
Publikováno v:
journal: Theor. Comput. Sci. volume: 927 pages: 133 - 147 year: 2022
The classic string indexing problem is to preprocess a string $S$ into a compact data structure that supports efficient subsequent pattern matching queries, that is, given a pattern string $P$, report all occurrences of $P$ within $S$. In this paper,
Externí odkaz:
http://arxiv.org/abs/2007.04128
Publikováno v:
In Theoretical Computer Science 26 August 2022 927:133-147
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.
Deterministic finite automata (DFA) are a classic tool for high throughput matching of regular expressions, both in theory and practice. Due to their high space consumption, extensive research has been devoted to compressed representations of DFAs th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbcb759bee05f9446b6ce4ed1542a703
http://arxiv.org/abs/2306.12771
http://arxiv.org/abs/2306.12771
Publikováno v:
Bille, P, Gørtz, I L, Pedersen, M R, Rotenberg, E & Steiner, T A 2020, String indexing for top-k close consecutive occurrences . in N Saxena & S Simon (eds), Proceedings of 40 th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science ., 14, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, Goa, India, 14/12/2020 . https://doi.org/10.4230/LIPIcs.FSTTCS.2020.14
Bille, P, Gørtz, I L, Pedersen, M R, Rotenberg, E & Steiner, T A 2022, ' String indexing for top-k close consecutive occurrences ', Theoretical Computer Science, vol. 927, pp. 133-147 . https://doi.org/10.1016/j.tcs.2022.06.004
Bille, P, Gørtz, I L, Pedersen, M R, Rotenberg, E & Steiner, T A 2022, ' String indexing for top-k close consecutive occurrences ', Theoretical Computer Science, vol. 927, pp. 133-147 . https://doi.org/10.1016/j.tcs.2022.06.004
The classic string indexing problem is to preprocess a string $S$ into a compact data structure that supports efficient subsequent pattern matching queries, that is, given a pattern string $P$, report all occurrences of $P$ within $S$. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d6329a62f5a6c93b99c397d0d3f6bfc