Sciweavers

1028 search results - page 23 / 206
» Character sets of strings
Sort
View
ICPR
2000
IEEE
13 years 12 months ago
Hidden Markov Random Field Based Approach for Off-Line Handwritten Chinese Character Recognition
This paper presents a Hidden Markov Mesh Random Field (HMMRF) based approach for off-line handwritten Chinese characters recognition using statistical observation sequences embedd...
Qing Wang, Rongchun Zhao, Zheru Chi, David Dagan F...
ICDAR
2009
IEEE
13 years 5 months ago
CASIA-OLHWDB1: A Database of Online Handwritten Chinese Characters
This paper describes a publicly available database, CASIA-OLHWDB1, for research on online handwritten Chinese character recognition. This database is the first of our series of on...
Da-Han Wang, Cheng-Lin Liu, Jin-Lun Yu, Xiang-Dong...
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
13 years 9 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
FOCS
2003
IEEE
14 years 25 days ago
Zero-Knowledge Sets
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
Silvio Micali, Michael O. Rabin, Joe Kilian
COCOON
2009
Springer
14 years 2 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta