2304 search results - page 213 / 461 » On the Vulnerability of Large Graphs |
146
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. In this paper we show the following conjecture of Alon. Fix an integer d > 2 and a real > 0. Then...
118
click to vote
GD
2007
Springer
16 years 23 days ago
2007
Springer
We prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any ε > 0 there is a δ > 0 such that for n sufficiently large...
173
click to vote
ACL
2004
15 years 8 months ago
2004
We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dep...
177
click to vote
ACL
2010
15 years 4 months ago
2010
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
178
click to vote
ICC
2007
IEEE
16 years 28 days ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...