6105 search results - page 134 / 1221 » A Parallel Algorithm for Bound-Smoothing |
208
click to vote
IDEAS
2006
IEEE
16 years 1 months ago
2006
IEEE
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
164
click to vote
MMSP
2008
IEEE
16 years 1 months ago
2008
IEEE
—Automatic cell segmentation and tracking in optical microscope images plays a very important role in the study the behaviour of lymphocytes. The variable image contrasts, and es...
174
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
178
click to vote
CLUSTER
2009
IEEE
15 years 11 months ago
2009
IEEE
—Statistical analysis is widely used for countless scientific applications in order to analyze and infer meaning from data. A key challenge of any statistical analysis package a...
181
click to vote
ISHPC
2003
Springer
16 years 5 days ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...