Načítá se...
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
We study the problem of finding a given [Formula: see text] matrix as a submatrix of a given Boolean matrix. Three variants are considered: search for a matching submatrix of any area, of minimum area, or of maximum area. The problem relates to 2D pattern matching, and to fields such as data mining,...
Uloženo v:
| Vydáno v: | Developments in Language Theory |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2020
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7247910/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48516-0_20 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|