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...
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...
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...
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...
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...