186 search results - page 14 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
CIAC
2010
Springer
14 years 4 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
IDA
2002
Springer
13 years 7 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
TSP
2008
13 years 7 months ago
2008
Abstract--In this paper, we study simultaneous matrix diagonalization-based techniques for the estimation of the mixing matrix in underdetermined independent component analysis (IC...