48 search results - page 2 / 10 » A Parallel Algorithm for Relational Coarsest Partition Probl... |
TPDS
2002
13 years 7 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
EUROPAR
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...
NIPS
2004
13 years 9 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
EUROPAR
2004
Springer
13 years 11 months ago
2004
Springer
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
EUROPAR
2003
Springer
14 years 25 days ago
2003
Springer
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...