358 search results - page 35 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
128
click to vote
PDP
2002
IEEE
15 years 6 months ago
2002
IEEE
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
107
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. We propose a probabalistic model of single source multimodal generation and show how algorithms for maximizing mutual information can find the correspondences between com...
117
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
117
click to vote
ESCIENCE
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
128
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity lin...