Sciweavers

1028 search results - page 4 / 206
» Character sets of strings
Sort
View
PRL
2000
148views more  PRL 2000»
13 years 7 months ago
One-dimensional representation of two-dimensional information for HMM based handwriting recognition
: In this study, we introduce a set of one-dimensional features to represent two dimensional shape information for HMM (Hidden Markov Model) based handwritten optical character rec...
Nafiz Arica, Fatos T. Yarman-Vural
SPIRE
2005
Springer
14 years 29 days ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel
SOFSEM
2010
Springer
14 years 4 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
KDD
2002
ACM
119views Data Mining» more  KDD 2002»
14 years 8 months ago
On effective classification of strings with wavelets
In recent years, the technological advances in mapping genes have made it increasingly easy to store and use a wide variety of biological data. Such data are usually in the form o...
Charu C. Aggarwal
ICPR
2008
IEEE
14 years 1 months ago
On-line handwritten Kanji string recognition based on grammar description of character structures
In this paper, we evaluate a method for on-line handwritten Kanji character recognition by describing the structure of Kanji using Stochastic Context-Free Grammar (SCFG), and exte...
Ikumi Ota, Ryo Yamamoto, Takuya Nishimoto, Shigeki...