1949 search results - page 297 / 390 » Random graphs on surfaces |
182
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...
143
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...
124
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...
136
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
147
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...