Sciweavers

6939 search results - page 70 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
IJCNN
2006
IEEE
14 years 2 months ago
Methods for Parallelizing the Probabilistic Neural Network on a Beowulf Cluster Computer
—In this paper, we present three different methods for implementing the Probabilistic Neural Network on a Beowulf cluster computer. The three methods, Parallel Full Training Set ...
Jimmy Secretan, Michael Georgiopoulos, Ian Maidhof...
IEEEHPCS
2010
13 years 6 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
ISPDC
2008
IEEE
14 years 2 months ago
Computing Equilibria in Bimatrix Games by Parallel Support Enumeration
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
Jonathan Widger, Daniel Grosu
ICPP
2009
IEEE
14 years 2 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu
PVM
1999
Springer
14 years 9 days ago
Parallel Computation of the SVD of a Matrix Product
In this paper we study a parallel algorithm for computing the singular value decomposition (SVD) of a product of two matrices on message passing multiprocessors. This algorithm is ...
José M. Claver, Manuel Mollar, Vicente Hern...