18 search results - page 1 / 4 » Distributed Computing with Advice: Information Sensitivity o... |
131
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
154
Voted
LCPC
1994
Springer
15 years 7 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
144
click to vote
EUROPAR
2005
Springer
15 years 9 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
128
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
111
Voted
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...