Many structured information extraction tasks employ collective graphical models that capture interinstance associativity by coupling them with various clique potentials. We propos...
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...
A new effective modification of the method which is described in [1] for solving of real symmetric circulant pentadiagonal systems of linear equations is proposed. We consider t...
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
The concatenable processes of a Petri net N can be characterized ly as the arrows of a symmetric monoidal category P[N]. Yet, this is only a partial axiomatization, since P[N] is b...