865 search results - page 160 / 173 » Random graph models for the web graph |
FSTTCS
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
SWAT
2004
Springer
14 years 22 days ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Currently most link-related applications treat all links in the same web page to be identical. One link-related application usually requires one certain property of hyperlinks but...
WWW
2002
ACM
14 years 8 months ago
2002
ACM
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the rel...
WWW
2002
ACM
14 years 8 months ago
2002
ACM
Real-scale Semantic Web applications, such as Knowledge Portals and E-Marketplaces, require the managementof large volumes of metadata, i.e., information describing the available ...