Background: Most microarray experiments are carried out with the purpose of identifying genes whose expression varies in relation with specific conditions or in response to enviro...
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Background: High-throughput technologies have led to a new era of proteomics. Although protein microarray experiments are becoming more common place there are a variety of experim...
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...