We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Abstract: We present a method for simultaneous three-dimensional (3D) structure generation and pharmacophorebased alignment using a self-organizing algorithm called Stochastic Prox...
Across the field of inverse problems in image and video processing, nearly all algorithms have various parameters which need to be set in order to yield good results. In practice, ...
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
This paper describes a new method for improving the accuracy of range information using low resolution ultrasonic sensors mounted on a mobile robot. These sensors emit ultra-sound...