We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
This paper proposes an inverse kinematic model for deformable robots made entirely of electro-active polymer gel. The required method is to control higher degrees of freedom than ...
Abstract. This paper presents a new registration method called Transitive InverseConsistent Manifold Registration (TICMR). The TICMR method jointly estimates correspondence maps be...
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...