Sciweavers

486 search results - page 33 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 1 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
CVPR
2010
IEEE
14 years 3 months ago
Parallel Graph-cuts by Adaptive Bottom-up Merging
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
Jiangyu Liu, Jian Sun
COMAD
1994
13 years 9 months ago
An Adaptive, Load Balancing Parallel Join Algorithm
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
Minesh B. Amin, Donovan A. Schneider, V. Singh
CEC
2009
IEEE
14 years 2 months ago
Plateau Connection Structure and multiobjective metaheuristic performance
—This paper proposes the plateau structure imposed by the Pareto dominance relation as a useful determinant of multiobjective metaheuristic performance. In essence, the dominance...
Deon Garrett
VLDB
1992
ACM
140views Database» more  VLDB 1992»
13 years 11 months ago
Practical Skew Handling in Parallel Joins
We present an approach to dealing with skew in parallel joins in database systems. Our approach is easily implementable within current parallel DBMS, and performs well on skewed d...
David J. DeWitt, Jeffrey F. Naughton, Donovan A. S...