Sciweavers

403 search results - page 4 / 81
» Can we ever catch up with the Web
Sort
View
JASIS
2007
121views more  JASIS 2007»
13 years 7 months ago
Can citation analysis of Web publications better detect research fronts?
We present evidence that, in some research fields, research published in journals and reported on the Web may collectively represent different evolutionary stages of the field wit...
Dangzhi Zhao, Andreas Strotmann
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
14 years 1 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
ML
2000
ACM
150views Machine Learning» more  ML 2000»
13 years 7 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
EUSAI
2007
Springer
14 years 1 months ago
A Web 2.0 Platform to Enable Context-Aware Mobile Mash-Ups
Context-aware systems allow users to access services and multimedia data according to their current context (location, identity, preferences). Web 2.0 fosters user contribution and...
Diego López de Ipiña, Juan Ignacio V...
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 2 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen