38 search results - page 5 / 8 » Rescheduling for Locality in Sparse Matrix Computations |
SCIA
2009
Springer
14 years 21 days ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
PPAM
2005
Springer
13 years 11 months ago
2005
Springer
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
ECCV
2004
Springer
14 years 8 months ago
2004
Springer
We introduce a technique for measuring local scale, based on a special property of the so-called total variational (TV) flow. For TV flow, pixels change their value with a speed th...
TOG
2010
13 years 26 days ago
2010
Accurately rendering glossy materials in design applications, where previewing and interactivity are important, remains a major challenge. While many fast global illumination solu...
SIAMNUM
2011
12 years 9 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...