2079 search results - page 310 / 416 » Universality of random graphs |
141
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
133
click to vote
GCC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
186
click to vote
WIDM
2004
ACM
15 years 9 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
145
click to vote
AP2PC
2004
Springer
15 years 9 months ago
2004
Springer
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
132
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...