2270 search results - page 82 / 454 » On the distribution of eigenvalues of graphs |
152
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
An information-theoretic analysis of a multi-keyhole channel, which includes a number of statistically independent keyholes with possibly different correlation matrices, is given. ...
155
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
133
click to vote
UAI
2004
15 years 7 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
150
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...