Sciweavers

416 search results - page 10 / 84
» A Paradigm for Parallel Matrix Algorithms:
Sort
View
APIN
2005
87views more  APIN 2005»
14 years 11 months ago
Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms
In the direct solution of sparse symmetric and positive definite linear systems, finding an ordering of the matrix to minimize the height 1
Wen-Yang Lin
PPSC
1997
15 years 9 days ago
Parallel Extensions to the Matrix Template Library
We present the preliminary design for a C++ template library to enable the compositional construction of matrix classes suitable for high performance numerical linear algebra comp...
Andrew Lumsdaine, Brian C. McCandless
JCIT
2010
150views more  JCIT 2010»
14 years 5 months ago
Characteristic Description of Coupled Task Sets Based on Design Structure Matrix and Its Optimal Time and Efforts Solution by Ge
The complicated interactions among tasks lead to iterations in product design and development. To maintain the market share, enterprises should effectively manage their product de...
Ting-gui Chen, Chun-hua Ju
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
15 years 5 months ago
Solving Consensus and Semi-supervised Clustering Problems Using Nonnegative Matrix Factorization
Consensus clustering and semi-supervised clustering are important extensions of the standard clustering paradigm. Consensus clustering (also known as aggregation of clustering) ca...
Tao Li, Chris H. Q. Ding, Michael I. Jordan
MMM
2005
Springer
163views Multimedia» more  MMM 2005»
15 years 4 months ago
Parallel Image Matrix Compression for Face Recognition
The canonical face recognition algorithm Eigenface and Fisherface are both based on one dimensional vector representation. However, with the high feature dimensions and the small ...
Dong Xu, Shuicheng Yan, Lei Zhang, Mingjing Li, We...