Since it is extremely expensive to collect a large volume of handwriting samples, synthesized data are often used to enlarge the training set. We argue that, in order to generate ...
Results of any clustering algorithm are highly sensitive to features that limit their generalization and hence provide a strong motivation to integrate shape information into the ...
Mohammed Ameer Ali, Gour C. Karmakar, Laurence S. ...
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
We propose a method for segmentation of 3D scanned shapes into simple geometric parts. Given an input point cloud, our method computes a set of components which possess one or mor...