Sciweavers

491 search results - page 37 / 99
» Ranking Abstractions
Sort
View
SIGIR
2004
ACM
14 years 2 months ago
Federated Search of Text-Based Digital Libraries in Hierarchical Peer-to-Peer Networks
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...
Jie Lu, Jamie Callan
SIGIR
1998
ACM
14 years 27 days ago
The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries
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...
Jaime G. Carbonell, Jade Goldstein
ESANN
2000
13 years 10 months ago
Committee formation for reliable and accurate neural prediction in industry
Abstract. This paper describes "cranking", a new committee formation algorithm. Cranking results in accurate and reliable committee predictions, even when applied to comp...
Peter J. Edwards, Alan F. Murray
FSTTCS
2008
Springer
13 years 9 months ago
Some Sieving Algorithms for Lattice Problems
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 ...
Vikraman Arvind, Pushkar S. Joglekar
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 8 months ago
Comparing and Combining Methods for Automatic Query Expansion
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...
José R. Pérez-Agüera, Lourdes A...