Roman Kolpakov

activity

20162022

most citedIndexing and querying color sets of images

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2022

Almost optimal searching of maximal subrepetitions in a word

Roman Kolpakov

For $0 < δ < 1$ a $δ$ -subrepetition in a word is a factor which exponent is less than~2 but is not less than $1 + δ$ (the exponent of the factor is the ratio of the factor length to its…

cs.FL2017

On the number of gapped repeats with arbitrary gap

Roman Kolpakov

For any functions $f (x)$ , $g (x)$ from $N$ to $R$ we call repeats $uv u$ such that $g (∣ u ∣) \leq ∣ v ∣ \leq f (∣ u ∣)$ as {\it $f, g$ -gapped repeats}. We study the possible…

cs.DS2016★ 1 cited

Indexing and querying color sets of images

Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot

We aim to study the set of color sets of continuous regions of an image given as a matrix of $m$ rows over $n \geq m$ columns where each element in the matrix is an integer from $[1…