Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel met...
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on pred...
The recent ability to measure quickly and inexpensively dense sets of points on physical objects has deeply influenced the way engineers used to represent shapes in CAD systems, ...
Alex Yvart, Stefanie Hahmann, Georges-Pierre Bonne...
We are interested in the simulation and optimization of gas transport in networks. Different regions of the network may be modelled by different equations. There are three models...
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...