Sciweavers

2720 search results - page 294 / 544
» Parallel Pairwise Clustering.
Sort
View
IPPS
2005
IEEE
16 years 7 days ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...
199
Voted
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 11 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...
IPPS
1996
IEEE
15 years 10 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
SNPD
2008
15 years 8 months ago
An Efficient Parallel Eye Detection Algorithm on Facial Color Images
As processing power becomes cheaper and more available in cluster of computers, the need for parallel algorithm that can harness this computing potentials will increase. One applic...
Jalal A. Nasiri, M. Amir Moulavi, Sepideh Nazemi G...
EUROPAR
2009
Springer
15 years 4 months ago
A Parallel Point Matching Algorithm for Landmark Based Image Registration Using Multicore Platform
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...
Lin Yang, Leiguang Gong, Hong Zhang, John L. Noshe...