The complexity of the cluster-based web service challenges the traditional approaches, which fail to guarantee the reliability and real-time performance required. In this paper, w...
In flow visualization, field lines are often used to convey both global and local structure and movement of the flow. One challenge is to find and classify the representative fiel...
Jishang Wei, Chaoli Wang, Hongfeng Yu, Kwan-Liu Ma
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier,...
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...
Chadi Assi, Ahmad Khalil, Nasir Ghani, Abdallah Sh...