Linear systems with structures such as Toeplitz-, Vandermonde- or Cauchy-likeness can be solved in O˜(α2 n) operations, where n is the matrix size, α is its displacement rank, ...
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
In this paper a completely automatic face recognition system is presented. The system is inspired by the elastic bunch graph method, but the fiducial point localization is complet...
This paper describes an algorithm for the efficient solution of large systems of Boolean equations. The algorithm exploits the fact that, in some cases, the composition operation ...
Self-healing relies on correct diagnosis of system malfunctioning. This paper presents a use-case based approach to self-diagnosis. Both a static and a dynamic model of a managed-s...
A. Reza Haydarlou, Benno J. Overeinder, Michel A. ...