3047 search results - page 155 / 610 » Randomized Parallel Selection |
JPDC
2008
14 years 11 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
130
click to vote
TNN
2008
14 years 11 months ago
2008
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
To bridge the gap between high level semantic concepts and low level visual features in content-based image retrieval (CBIR), online feature selection is really required. An effec...
SDM
2009
SIAM
15 years 8 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
INFOCOM
2009
IEEE
15 years 5 months ago
2009
IEEE
—In this paper we propose to construct an flexible delay line with maximum delay d by parallel non-overtaking delay lines. We show that for a fixed number of non-overtaking del...