Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Theory of computation ��� Data compression"'
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.
A finite group of order $n$ can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order $n$ can be stored using $O(n^2)$ words and can be used to answer a multiplication query in constant time. It is interesting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd54375113e776d1340a47e003b317ea
http://arxiv.org/abs/2303.01957
http://arxiv.org/abs/2303.01957
Autor:
Bulteau, Laurent, Lipták, Zsuzsanna
LIPIcs, Volume 259, CPM 2023, Complete Volume
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 1-472
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 1-472
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8239b9890ef3ece0d51fe9454979140
Autor:
Bulteau, Laurent, Lipták, Zsuzsanna
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 0:i-0:xvi
LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 0:i-0:xvi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0d916bec0defafb7a65b516dd27489d
Autor:
Navarro, Gonzalo, Urbina, Cristian
In order to use them for compression, we extend L-systems (without ε-rules) with two parameters d and n, and also a coding τ, which determines unambiguously a string w = τ(φ^d(s))[1:n], where φ is the morphism of the system, and s is its axiom.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e514cfad93cc2d90f959745084f28cd6
Autor:
Arroyuelo, Diego, Castillo, Juan Pablo
We introduce space- and time-efficient algorithms and data structures for the offline set intersection problem. We show that a sorted integer set S ⊆ [0..u) of n elements can be represented using compressed space while supporting k-way intersection
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::134c203edd79123512e89efa7fced612
The task of computing homomorphisms between two finite relational structures $\mathcal{A}$ and $\mathcal{B}$ is a well-studied question with numerous applications. Since the set $\operatorname{Hom}(\mathcal{A},\mathcal{B})$ of all homomorphisms may b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df201e5cbc569585261abb515b0b10a8
Morphisms are widely studied combinatorial objects that can be used for generating infinite families of words. In the context of Information theory, injective morphisms are called (variable length) codes. In Data compression, the morphisms, combined
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40c05defe104123912d1493b72c78def
Autor:
Bannai, Hideo, Funakoshi, Mitsuru, Kurita, Kazuhiro, Nakashima, Yuto, Seto, Kazuhisa, Uno, Takeaki
LZ-End is a variant of the well-known Lempel-Ziv parsing family such that each phrase of the parsing has a previous occurrence, with the additional constraint that the previous occurrence must end at the end of a previous phrase. LZ-End was initially
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1c2a5858ce554b1b2d64a4c53433c85
Publikováno v:
Schwiegelshohn, C & Sheikh-Omar, O A 2022, An Empirical Evaluation of k-Means Coresets . in S Chechik, G Navarro, E Rotenberg & G Herman (eds), 30th Annual European Symposium on Algorithms, ESA 2022 . Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 244, pp. 84:1-84:17, 30th Annual European Symposium on Algorithms, ESA 2022, Berlin/Potsdam, Germany, 05/09/2022 . https://doi.org/10.4230/LIPIcs.ESA.2022.84
Coresets are among the most popular paradigms for summarizing data. In particular, there exist many high performance coresets for clustering problems such as k-means in both theory and practice. Curiously, there exists no work on comparing the qualit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5daafbf54bcb8c1b65ebbaca4a35ac6c
http://arxiv.org/abs/2207.00966
http://arxiv.org/abs/2207.00966