This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel a...
Holger Blaar, Thomas Lange, Renate Winter, Marcel ...
Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...
Traditionally, distributed computing problems have been solved by partitioning data into chunks able to be handled by commodity hardware. Such partitioning is not possible in case...
—Parallel firewalls offer a scalable low latency design for inspecting packets at high speeds. Typically consisting of an array of m firewalls, these systems filter arriving p...
Michael R. Horvath, Errin W. Fulp, Patrick Wheeler