— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
This paper deals with the reconstruction of 2-dimensional geometric shapes from unorganized 1-dimensional cross-sections. We study the problem in its full generality following the...
This paper introduces a new stochastic surface model for deformable 3D surfaces and demonstrates its utility for the purpose of 3D sculpting. This is the problem of simple-touse a...
Andrew R. Willis, Jasper Speicher, David B. Cooper
As the first step toward a multi-scale, hierarchical computational approach for membrane protein structure prediction, the packing of transmembrane helices was modeled at the resi...
We investigate the problem of source separation in images in the Bayesian framework using the color channel dependencies. As a case in point we consider the source separation of co...