2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DS2023★ 2 cited
Efficient algorithms for enumerating maximal common subsequences of two strings
Miyuji Hirota, Yoshifumi Sakai
We propose efficient algorithms for enumerating maximal common subsequences (MCSs) of two strings. Efficiency of the algorithms are estimated by the preprocessing-time, space, and…
cs.RO2022
Hibikino-Musashi@Home 2022 Team Description Paper
Tomoya Shiba, Tomohiro Ono, Shoshi Tokuno +27
Our team, Hibikino-Musashi@Home (HMA), was founded in 2010. It is based in Japan in the Kitakyushu Science and Research Park. Since 2010, we have annually participated in the RoboC…
cs.DS2020
A faster reduction of the dynamic time warping distance to the longest increasing subsequence length
Yoshifumi Sakai, Shunsuke Inenaga
The similarity between a pair of time series, i.e., sequences of indexed values in time order, is often estimated by the dynamic time warping (DTW) distance, instead of any in the…