Sciweavers

19 search results - page 1 / 4
» Approximate Stroke Sequence String Matching Algorithm for Ch...
Sort
View
ICCV
2003
IEEE
14 years 7 months ago
Dynamic Stroke Information Analysis for Video-Based Handwritten Chinese Character Recognition
Video-based handwritten Character Recognition (VCR) system is a new type of character recognition system with many unique advantages over on-line character recognition system. Its...
Feng Lin, Xiaoou Tang
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
13 years 10 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
ICDAR
2009
IEEE
13 years 3 months ago
Stochastic Model of Stroke Order Variation
A stochastic model of stroke order variation is proposed and applied to the stroke-order free on-line Kanji character recognition. The proposed model is a hidden Markov model (HMM...
Yoshinori Katayama, Seiichi Uchida, Hiroaki Sakoe
CIKM
2001
Springer
13 years 9 months ago
Improved String Matching Under Noisy Channel Conditions
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
Kevyn Collins-Thompson, Charles Schweizer, Susan T...