1028 search results - page 84 / 206 » Character sets of strings |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
CPC
2008
13 years 9 months ago
2008
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
ICPR
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper, stochastic error-correcting parsing is proposed as a powerful and flexible method to post-process the results of an optical character recognizer (OCR). Determinist...
IDA
1998
Springer
13 years 8 months ago
1998
Springer
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...