<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ravi Kumar</style></author><author><style face="normal" font="default" size="100%">Lang, Kevin</style></author><author><style face="normal" font="default" size="100%">Cameron Marlow</style></author><author><style face="normal" font="default" size="100%">Andrew Tomkins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Efficient discovery of authoritative resources</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of ICDE 2008</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">crawling</style></keyword><keyword><style  face="normal" font="default" size="100%">graph theory</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pub-location><style face="normal" font="default" size="100%">Cancun, Mexico</style></pub-location><isbn><style face="normal" font="default" size="100%">978-1-4244-1836-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Given a dynamic corpus whose content and attention are changing on a daily basis, is it possible to collect and maintain the high-quality resources with a minimal investment? We address two problems that arise from this question for hyperlinked corpora such as Web pages or blogs: how to efficiently discover the correct set of authoritative resources given a fixed network, and how to track these resources over time as new entrants arrive, old standbys depart, and existing participants change roles.</style></abstract></record></records></xml>