1185 search results - page 123 / 237 » An Improved Parallel Thinning Algorithm |
141
click to vote
PODC
2011
ACM
14 years 23 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
EUROPAR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
TASLP
2010
14 years 4 months ago
2010
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
166
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...