491 search results - page 37 / 99 » Ranking Abstractions |
108
click to vote
SIGIR
2004
ACM
15 years 7 months ago
2004
ACM
Abstract. Peer-to-peer architectures are a potentially powerful model for developing large-scale networks of text-based digital libraries, but peer-to-peer networks have so far pro...
108
click to vote
SIGIR
1998
ACM
15 years 6 months ago
1998
ACM
Abstract This paper presents a method for combining query-relevance with information-novelty in the context of text retrieval and summarization. The Maximal Marginal Relevance (MMR...
ESANN
2000
15 years 3 months ago
2000
Abstract. This paper describes "cranking", a new committee formation algorithm. Cranking results in accurate and reliable committee predictions, even when applied to comp...
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
115
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Query expansion is a well known method to improve the performance of information retrieval systems. In this work we have tested different approaches to extract the candid...