6897 search results - page 121 / 1380 » Parallelization of Modular Algorithms |
KDD
2002
ACM
14 years 9 months ago
2002
ACM
Text classification is the process of classifying documents into predefined categories based on their content. Existing supervised learning algorithms to automatically classify te...
PPAM
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
ICPP
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
ICCSA
2004
Springer
14 years 2 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
IPL
2006
13 years 8 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing