315 search results - page 48 / 63 » Eigenvalue bounds for independent sets |
78
Voted
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
101
click to vote
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
—Although capacity has been extensively studied in wireless networks, most of the results are for homogeneous wireless networks where all nodes are assumed identical. In this pap...
STOC
2002
ACM
15 years 11 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
ALT
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...