3047 search results - page 155 / 610 » Randomized Parallel Selection |
104
Voted
JPDC
2008
15 years 2 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 ...
155
click to vote
TNN
2008
15 years 2 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...
136
Voted
ICMCS
2006
IEEE
15 years 8 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...
121
click to vote
SDM
2009
SIAM
15 years 11 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...
118
click to vote
INFOCOM
2009
IEEE
15 years 9 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...