1542 search results - page 217 / 309 » The metamathematics of random graphs |
113
click to vote
KDD
2006
ACM
16 years 2 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...
141
Voted
INFOCOM
2009
IEEE
15 years 8 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...
118
click to vote
INFOCOM
2009
IEEE
15 years 8 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...
136
click to vote
ECSQARU
2009
Springer
15 years 8 months 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...
102
Voted
IV
2002
IEEE
15 years 6 months ago
2002
IEEE
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...