2303 search results - page 149 / 461 » Interior-Point Methods in Parallel Computation |
175
Voted
DATAMINE
1999
15 years 3 months ago
1999
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
140
Voted
SIAMSC
2011
14 years 6 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
131
Voted
ICPADS
2006
IEEE
15 years 9 months ago
2006
IEEE
While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely at...
116
click to vote
PDP
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract—We investigate the scalability of the hypergraphbased sparse matrix partitioning methods with respect to the increasing sizes of matrices and number of nonzeros. We prop...
113
click to vote
ICPADS
2005
IEEE
15 years 9 months ago
2005
IEEE
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...