186 search results - page 22 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
SIAMNUM
2011
12 years 10 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...
PDPTA
2008
13 years 9 months ago
2008
Solving linear systems with a large number of variables is at the core of many scienti c problems. Parallel processing techniques for solving such systems have received much attent...
EPIA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we propose an incremental item-based collaborative filtering algorithm. It works with binary ratings (sometimes also called implicit ratings), as it is typi...
WEA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...