Sciweavers

7930 search results - page 1380 / 1586
» Greedy in Approximation Algorithms
Sort
View
WWW
2008
ACM
16 years 5 months ago
An Effective Aggregation Policy for RSS Services
RSS is the XML-based format for syndication of Web contents and users aggregate RSS feeds with RSS feed aggregators. As the usage of RSS service has been diffused, it is crucial to...
Jae Hwi Kim, Sang Ho Lee, Young Geun Han
WWW
2008
ACM
16 years 5 months ago
Web graph similarity for anomaly detection (poster)
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
Panagiotis Papadimitriou 0002, Ali Dasdan, Hector ...
WWW
2007
ACM
16 years 5 months ago
Designing efficient sampling techniques to detect webpage updates
Due to resource constraints, Web archiving systems and search engines usually have difficulties keeping the entire local repository synchronized with the Web. We advance the state...
Qingzhao Tan, Ziming Zhuang, Prasenjit Mitra, C. L...
142
Voted
WWW
2005
ACM
16 years 5 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
129
Voted
CAV
2009
Springer
135views Hardware» more  CAV 2009»
16 years 5 months ago
Sliding Window Abstraction for Infinite Markov Chains
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
Thomas A. Henzinger, Maria Mateescu, Verena Wolf
« Prev « First page 1380 / 1586 Last » Next »