Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
A problem of eliminating the unwanted time-harmonic noise on a predetermined region of interest is solved by active means, i.e., by introducing the additional sources of sound, cal...
In the field of image segmentation, most of level-set-based active contour approaches are based on a discrete representation of the associated implicit function. We present in thi...
Olivier Bernard, Denis Friboulet, Philippe Th&eacu...
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...
Yong-Liang Yang, Junho Kim, Feng Luo 0002, Shi-Min...