3267 search results - page 58 / 654 » Generalized quasirandom graphs |
TIT
2011
14 years 6 months ago
2011
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
116
click to vote
JMLR
2010
14 years 5 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
102
click to vote
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...
93
Voted
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
ENDM
2006
14 years 11 months ago
2006
In this note, we prove the uniqueness of the one-point extension S of a generalized hexagon of order 2 and prove the non-existence of such an extension S of any other finite gener...