Sciweavers

230 search results - page 24 / 46
» Sparse matrix factorization on massively parallel computers
Sort
View
ECML
2007
Springer
15 years 3 months ago
Stability Based Sparse LSI/PCA: Incorporating Feature Selection in LSI and PCA
The stability of sample based algorithms is a concept commonly used for parameter tuning and validity assessment. In this paper we focus on two well studied algorithms, LSI and PCA...
Dimitrios Mavroeidis, Michalis Vazirgiannis
SC
1994
ACM
15 years 1 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar
IPPS
1996
IEEE
15 years 1 months ago
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
Cong Fu, Tao Yang
IJCNN
2008
IEEE
15 years 4 months ago
Sparse support vector machines trained in the reduced empirical feature space
— We discuss sparse support vector machines (sparse SVMs) trained in the reduced empirical feature space. Namely, we select the linearly independent training data by the Cholesky...
Kazuki Iwamura, Shigeo Abe
SIAMSC
2008
131views more  SIAMSC 2008»
14 years 9 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner