162 search results - page 14 / 33 » A Relational Approach to the Compilation of Sparse Matrix Pr... |
SIAMNUM
2011
14 years 2 months ago
2011
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
118
click to vote
UAI
2007
15 years 26 days ago
2007
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
105
Voted
PPOPP
2006
ACM
15 years 5 months ago
2006
ACM
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to ...
134
click to vote
SIAMREV
2010
14 years 6 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
FUIN
2006
14 years 11 months ago
2006
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...