Sciweavers

1109 search results - page 11 / 222
» Crawling on web graphs
Sort
View
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
15 years 8 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
WWW
2009
ACM
16 years 2 months ago
Sitemaps: above and beyond the crawl of duty
Comprehensive coverage of the public web is crucial to web search engines. Search engines use crawlers to retrieve pages and then discover new ones by extracting the pages' o...
Uri Schonfeld, Narayanan Shivakumar
142
Voted
CN
1999
242views more  CN 1999»
15 years 1 months ago
Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery
The rapid growth of the World-Wide Web poses unprecedented scaling challenges for general-purpose crawlers and search engines. In this paper we describe a new hypertext resource d...
Soumen Chakrabarti, Martin van den Berg, Byron Dom
84
Voted
WWW
2002
ACM
16 years 2 months ago
Optimal crawling strategies for web search engines
Joel L. Wolf, Mark S. Squillante, Philip S. Yu, Ja...
DEBU
2002
135views more  DEBU 2002»
15 years 1 months ago
Analyzing Fine-grained Hypertext Features for Enhanced Crawling and Topic Distillation
Early Web search engines closely resembled Information Retrieval (IR) systems which had matured over several decades. Around 1996
Soumen Chakrabarti, Ravindra Jaju