Zobrazeno 1 - 10
of 4 804
pro vyhledávání: '"tree-matching"'
Publikováno v:
IEEE Communications Letters, vol. 28, no. 7, pp. 1509-1513, July 2024
We introduce the spanning tree matching (STM) decoder for surface codes, which guarantees the error correction capability up to the code's designed distance by first employing an instance of the minimum spanning tree on a subset of ancilla qubits wit
Externí odkaz:
http://arxiv.org/abs/2405.01151
Two strings of the same length are said to Cartesian-tree match (CT-match) if their Cartesian-trees are isomorphic [Park et al., TCS 2020]. Cartesian-tree matching is a natural model that allows for capturing similarities of numerical sequences. Oizu
Externí odkaz:
http://arxiv.org/abs/2402.19146
Cartesian tree pattern matching consists of finding all the factors of a text that have the same Cartesian tree than a given pattern. There already exist theoretical and practical solutions for the exact case. In this paper, we propose the first algo
Externí odkaz:
http://arxiv.org/abs/2306.16065
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.
Web applications are constantly evolving to integrate new features and fix reported bugs. Even an imperceptible change can sometimes entail significant modifications of the Document Object Model (DOM), which is the underlying model used by browsers t
Externí odkaz:
http://arxiv.org/abs/2106.04916
The Cartesian-tree pattern matching is a recently introduced scheme of pattern matching that detects fragments in a sequential data stream which have a similar structure as a query pattern. Formally, Cartesian-tree pattern matching seeks all substrin
Externí odkaz:
http://arxiv.org/abs/2106.01595
Publikováno v:
In Information Systems February 2023 112
Tree matching techniques have been investigated in many fields, including web data mining and extraction, as a key component to analyze the content of web documents, existing tree matching approaches, like Tree-Edit Distance (TED) or Flexible Tree Ma
Externí odkaz:
http://arxiv.org/abs/2004.12821
Autor:
Ganassali, Luca, Massoulié, Laurent
Publikováno v:
Proceedings of Thirty Third Conference on Learning Theory, PMLR 125:1633-1665, 2020
In this paper we consider alignment of sparse graphs, for which we introduce the Neighborhood Tree Matching Algorithm (NTMA). For correlated Erd\H{o}s-R\'{e}nyi random graphs, we prove that the algorithm returns -- in polynomial time -- a positive fr
Externí odkaz:
http://arxiv.org/abs/2002.01258