We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to min...
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
In this paper we propose a domainindependent text segmentation method, which consists of three components. Latent Dirichlet allocation (LDA) is employed to compute words semantic ...
This paper presents a new transformation which adds fault-containment properties to any silent self-stabilizing protocol. The transformation features a constant slow-down factor a...