358 search results - page 8 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
118
click to vote
CRYPTO
2007
Springer
15 years 5 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
ICPR
2000
IEEE
16 years 24 days ago
2000
IEEE
We propose an algorithm for texture segmentation based on a divide-and-conquerstrategy of statistical modeling.Selectedsets of Gaussianclusters,estimated via ExpectationMaximizati...
SIGECOM
2008
ACM
14 years 11 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
154
click to vote
DILS
2010
Springer
15 years 25 days ago
2010
Springer
Matching life science ontologies to determine ontology mappings has recently become an active field of research. The large size of existing ontologies and the application of comple...
83
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we study how to appropriately match users for two-user cooperative diversity systems that deploy optimal power allocation for an amplify and forward or a regener...