Login / Signup
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings.
Kiichi Watanabe
Yuto Nakashima
Shunsuke Inenaga
Hideo Bannai
Masayuki Takeda
Published in:
Theory Comput. Syst. (2020)
Keyphrases
</>
run length
data structure
gray level
feature selection
worst case
computational complexity
computational cost
image sequences
multiresolution
motion estimation
high frequency