9842 search results - page 1336 / 1969 » The Complexity of the Matching-Cut Problem |
223
Voted
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
239
click to vote
PODS
2011
ACM
14 years 10 months ago
2011
ACM
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
240
click to vote
SIGECOM
2011
ACM
14 years 10 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
232
click to vote
SIGMOD
2011
ACM
14 years 10 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
215
click to vote
CIKM
2011
Springer
14 years 7 months ago
2011
Springer
We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document a...