Sciweavers

238 search results - page 11 / 48
» Exploiting Hybrid Parallelism in Web Search Engines
Sort
View
EPEW
2005
Springer
14 years 3 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
KDD
2007
ACM
169views Data Mining» more  KDD 2007»
14 years 10 months ago
Exploiting underrepresented query aspects for automatic query expansion
Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely ...
Daniel Crabtree, Peter Andreae, Xiaoying Gao
SIGIR
2009
ACM
14 years 4 months ago
Compressing term positions in web indexes
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
Hao Yan, Shuai Ding, Torsten Suel
ADC
2004
Springer
79views Database» more  ADC 2004»
14 years 3 months ago
Performance and Cost Tradeoffs in Web Search.
Web search engines crawl the web to fetch the data that they index. In this paper we re-examine that need, and evaluate the network costs associated with data acquisition, and alt...
Nick Craswell, Francis Crimmins, David Hawking, Al...
WEBI
2001
Springer
14 years 2 months ago
A Fast Image-Gathering System on the World-Wide Web Using a PC Cluster
Abstract. Thanks to the recent explosive progress of WWW (WorldWide Web), we can easily access a large number of images from WWW. There are, however, no established methods to make...
Keiji Yanai, Masaya Shindo, Kohei Noshita