Mesh segmentation has become an important component in many applications in computer graphics. In the last several years, many algorithms have been proposed in this growing area, ...
Marco Attene, S. Katz, Michela Mortara, Giuseppe P...
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
—In this paper, we address the scheduling problem for Clos-network switches with no buffers at the central stage. Existing scheduling (dispatching) algorithms for this type of sw...
Mei Yang, Mayauna McCullough, Yingtao Jiang, Jun Z...
We present in this paper a modification of Lumer and Faieta’s algorithm for data clustering. This algorithm discovers automatically clusters in numerical data without prior kno...
We give an overview of the algorithms and implementations in the high-performance MPI libraries MPI/SX and MPI/ES of some of the most important collective operations of MPI (the M...
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
Since graphics cards have become programmable the recent years, numerous computationally intensive algorithms have been implemented on the now called General Purpose Graphics Proc...
Marko Durkovic, Michael Zwick, Florian Obermeier, ...
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
Alysson Neves Bessani, Joni da Silva Fraga, Miguel...
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...