Sciweavers

794 search results - page 14 / 159
» Challenges in Parallel Graph Processing
Sort
View
PC
2010
177views Management» more  PC 2010»
13 years 7 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
IPPS
2008
IEEE
14 years 3 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
CCGRID
2003
IEEE
14 years 2 months ago
Using grid technologies to face medical image analysis challenges
The availability of digital imagers inside hospitals and their ever growing inspection capabilities have established digital medical images as a key component of many pathologies ...
Johan Montagnat, Vincent Breton, Isabelle E. Magni...
IPL
2006
139views more  IPL 2006»
13 years 9 months ago
An adjustable linear time parallel algorithm for maximum weight bipartite matching
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
Morteza Fayyazi, David R. Kaeli, Waleed Meleis
ISPAN
2005
IEEE
14 years 2 months ago
Process Scheduling for the Parallel Desktop
Commodity hardware and software are growing increasingly more complex, with advances such as chip heterogeneity and specialization, deeper memory hierarchies, ne-grained power ma...
Eitan Frachtenberg