Sciweavers

21 search results - page 1 / 5
» Towards Data Partitioning for Parallel Computing on Three In...
Sort
View
ISPDC
2007
IEEE
13 years 11 months ago
Towards Data Partitioning for Parallel Computing on Three Interconnected Clusters
We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can...
Brett A. Becker, Alexey L. Lastovetsky
CLUSTER
2006
IEEE
13 years 11 months ago
Matrix Multiplication on Two Interconnected Processors
This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the ...
Brett A. Becker, Alexey L. Lastovetsky
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 9 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
ECCV
2004
Springer
14 years 6 months ago
Parallel Variational Motion Estimation by Domain Decomposition and Cluster Computing
We present an approach to parallel variational optical flow computation on standard hardware by domain decomposition. Using an arbitrary partition of the image plane into rectangul...
Timo Kohlberger, Christoph Schnörr, Andr&eacu...
EUROPAR
2004
Springer
13 years 8 months ago
Efficient Parallel Hierarchical Clustering
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...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...