358 search results - page 11 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
109
click to vote
WIOPT
2010
IEEE
2010
IEEE
Low complexity algorithms for relay selection and power control in interference-limited environments
15 years 6 days ago
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
112
Voted
PDPTA
2000
15 years 3 months ago
2000
Abstract We describe an event-based, publishand-subscribe system based on using "smart subscriptions" to recognize weakly structured events. We present a hierarchy of sub...
131
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
208
Voted
COMPLIFE
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Molecular shapes play an important role in molecular interactions, e.g., between a protein and a ligand. The `outer' shape of a molecule can be approximated by its s...
141
click to vote
PVLDB
2011
14 years 8 months ago
2011
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for soci...