If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Abstract. We describe a parallel Fortran 77 implementation, in ScaLAPACK style, of a block matrix 1-norm estimator of Higham and Tisseur. This estimator differs from that underlyi...
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...
Elzbieta Krepska, Thilo Kielmann, Wan Fokkink, Hen...
The system of equations that govern kinematically redundant manipulators is commonly solved by nding the singular value decomposition (SVD) of the corresponding Jacobian matrix. T...
Tracy D. Braun, Anthony A. Maciejewski, Howard Jay...