358 search results - page 34 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
106
click to vote
CLUSTER
2001
IEEE
15 years 5 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
120
click to vote
CRYPTO
2001
Springer
15 years 6 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
110
click to vote
CLUSTER
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—Using MPI as communication interface, one or several applications may introduce complex communication behaviors over the network cluster. This effect is increased when n...
132
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...