Sciweavers

12659 search results - page 404 / 2532
» The distributed breakout algorithms
Sort
View
EUROPAR
1999
Springer
15 years 12 months ago
Parallel k/h-Means Clustering for Large Data Sets
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 ...
Kilian Stoffel, Abdelkader Belkoniene
IPPS
2005
IEEE
16 years 1 months ago
Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools
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 ...
DEBS
2008
ACM
15 years 9 months ago
Distributed automatic service composition in large-scale systems
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...
Songlin Hu, Vinod Muthusamy, Guoli Li, Hans-Arno J...
REST
2010
ACM
15 years 12 months ago
A RESTful messaging system for asynchronous distributed processing
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...
Ian Jacobi, Alexey Radul
ICCCN
2008
IEEE
16 years 2 months ago
Policy Distribution Methods for Function Parallel Firewalls
—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