1591 search results - page 207 / 319 » Random lifts of graphs |
146
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
175
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
202
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
173
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
214
click to vote
ECSQARU
2009
Springer
16 years 29 days ago
2009
Springer
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...