3875 search results - page 346 / 775 » Approximation algorithms for the 0-extension problem |
180
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
194
click to vote
PVLDB
2010
15 years 5 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
166
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
189
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
230
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...