186 search results - page 10 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
DAC
1996
ACM
13 years 11 months ago
1996
ACM
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
NIPS
2008
13 years 9 months ago
2008
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and m...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We describe parallel methods for solving large-scale, high-dimensional, sparse least-squares problems that arise in machine learning applications such as document classificatio...