358 search results - page 22 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
113
click to vote
ECCC
2010
14 years 11 months ago
2010
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
115
click to vote
DCC
2004
IEEE
16 years 1 months ago
2004
IEEE
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
116
click to vote
FTDCS
2004
IEEE
15 years 5 months ago
2004
IEEE
Distributed embedded sensor networks are now being successfully deployed in environmental monitoring of natural phenomena as well as for applications in commerce and physical secu...
117
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...