812 search results - page 80 / 163 » corr 2007 |
92
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
CORR
2007
Springer
15 years 18 days ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
107
click to vote
CORR
2007
Springer
15 years 18 days ago
2007
Springer
Common knowledge logic is meant to describe situations of the real world where a group of agents is involved. These agents share knowledge and make strong hypotheses on the knowled...
CORR
2007
Springer
15 years 18 days ago
2007
Springer
— While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, Shannon’s entropy power inequality (EPI) seems...
97
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
We define a multivariate polynomial that generalizes in a unified way the twovariable interlace polynomial defined by Arratia, Bollob´as and Sorkin on the one hand, and a one-...