The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe...
This paper proposes a recognition based approach to handwritten numeral string segmentation. We consider two classes: numeral strings segmented correctly or not. The feature vecto...
Information about string values at key points in a program can help program understanding, reverse engineering, and forensics. We present a static-analysis technique for recoverin...
This paper presents a probabilistic algorithm for segmenting and recognizing text embedded in video sequences. The algorithm approximates the posterior distribution of segmentatio...