1998 search results - page 186 / 400 » Complexity of the Cover Polynomial |
182
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
165
click to vote
JAIR
2006
15 years 6 months ago
2006
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
182
click to vote
DAM
2007
15 years 6 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
185
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
279
click to vote
DAI
1998
Springer
15 years 10 months ago
1998
Springer
A physically based system of interacting polyhedral objects is used to model self-assembly and spontaneous organization of complex structures. The surfaces of the polyhedra in the ...