Sciweavers

8125 search results - page 428 / 1625
» Parallelism and evolutionary algorithms
Sort
View
FUIN
2006
139views more  FUIN 2006»
15 years 5 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
141
Voted
IJDMB
2007
114views more  IJDMB 2007»
15 years 5 months ago
A parallel edge-betweenness clustering tool for Protein-Protein Interaction networks
: The increasing availability of protein-protein interaction graphs (PPI) requires new efficient tools capable of extracting valuable biological knowledge from these networks. Amon...
Qiaofeng Yang, Stefano Lonardi
EUROPAR
2004
Springer
15 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...
ICTAI
2003
IEEE
15 years 10 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
PPOPP
2012
ACM
14 years 18 days ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin