Handwriting recognition for hand-held devices like PDAs requires very accurate and adaptive classifiers. It is such a complex classification problem that it is quite usual now to make co-operate several classification methods. In this paper, we present an original two stages recognizer. The first stage is a model-based classifier which store an exhaustive set of character models. The second sta...

With the amount of sequence data deluge as a result of next generation sequencing, there comes a need to leverage the large-scale biological sequence data. Therefore, the role of high performance computational methods to mining interesting information solely from these sequence data becomes increasingly important. Almost everything in bioinformatics counts on the inter-relationship between sequ...

Financial markets are a typical example of complex systems where interactions between constituents lead to many remarkable features. Here we give empirical evidence, by making as few assumptions as possible, that the market microstructure capturing almost all of the available information in the data of stock markets does not involve higher order than pairwise interactions. We give an economic i...

We present a closed form upper bound for the average pairwise error probabilities (PEP) of space-time codes for a keyhole channel. It is derived from the exact conditional PEP for given fading channel coefficients, using a moment generating function-based approach. We include simulation results for varying numbers of antennas which affirm that the proposed PEP serves as a tight bound for codes ...

We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any m and k a random walk with k-wise independent steps which has no stationary distribution modulo m.

We define and study here the class of rational functions that are finite union of sequential functions. These functions can be realized by cascades of sequential transducers. After showing that cascades of any height are equivalent to cascades of height at most two and that this class strictly contains sequential functions and is strictly contained in the class of rational functions, we prove t...

We present a deterministic linear time algorithm to find a set of five points that stab a set of n pairwise intersecting disks in the plane. We also give a simple construction with 13 pairwise intersecting disks that cannot be stabbed by three points.

let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space—where k is logarithmic in n and independent of d—so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the n points onto a spherically random k-...