186 search results - page 36 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
WMPI
2004
ACM
13 years 11 months ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
SIAMCOMP
1998
13 years 5 months ago
1998
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
TVLSI
2010
13 years 28 days ago
2010
In many applications, a reduction of the amount of the original data or a representation of the original data by a small set of variables is often required. Among many techniques, ...
SIGIR
2009
ACM
14 years 23 days ago
2009
ACM
As an indispensable technique in the field of Information Filtering, Recommender System has been well studied and developed both in academia and in industry recently. However, mo...