Sciweavers

489 search results - page 3 / 98
» Evaluating aggregated search pages
Sort
View
WWW
2003
ACM
14 years 5 months ago
A new paradigm for ranking pages on the world wide web
This paper describes a new paradigm for modeling traffic levels on the world wide web (WWW) using a method of entropy maximization. This traffic is subject to the conservation con...
John A. Tomlin
IS
2008
13 years 4 months ago
Clustering spatial networks for aggregate query processing: A hypergraph approach
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...
Engin Demir, Cevdet Aykanat, Berkant Barla Cambazo...
ICWSM
2009
13 years 2 months ago
MakeMyPage: Social Media Meets Automatic Content Generation
Finding out about a topic online can be time consuming. It involves visiting multiple news sites, encyclopedia entries, video repositories and other resources while discarding irr...
Francisco Iacobelli, Kristian J. Hammond, Larry Bi...
SIGIR
2006
ACM
13 years 10 months ago
Finding near-duplicate web pages: a large-scale evaluation of algorithms
Broder et al.’s [3] shingling algorithm and Charikar’s [4] random projection based approach are considered “state-of-theart” algorithms for finding near-duplicate web pag...
Monika Rauch Henzinger
WEBI
2005
Springer
13 years 10 months ago
Adding the Temporal Dimension to Search - A Case Study in Publication Search
The most well known search techniques are perhaps the PageRank and HITS algorithms. In this paper we argue that these algorithms miss an important dimension, the temporal dimensio...
Philip S. Yu, Xin Li, Bing Liu