Sciweavers

1091 search results - page 48 / 219
» Swarming to rank for information retrieval
Sort
View
SIGIR
2002
ACM
13 years 8 months ago
Finding relevant documents using top ranking sentences: an evaluation of two alternative schemes
In this paper we present an evaluation of techniques that are designed to encourage web searchers to interact more with the results of a web search. Two specific techniques are ex...
Ryen White, Ian Ruthven, Joemon M. Jose
CIKM
2004
Springer
14 years 2 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
WWW
2010
ACM
14 years 4 months ago
RankCompete: simultaneous ranking and clustering of web photos
With the explosive growth of digital cameras and online media, it has become crucial to design efficient methods that help users browse and search large image collections. The rec...
Liangliang Cao, Andrey Del Pozo, Xin Jin, Jiebo Lu...
SIGIR
2004
ACM
14 years 2 months ago
Learning effective ranking functions for newsgroup search
Web communities are web virtual broadcasting spaces where people can freely discuss anything. While such communities function as discussion boards, they have even greater value as...
Wensi Xi, Jesper Lind, Eric Brill
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
14 years 3 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy