Sciweavers

4553 search results - page 165 / 911
» Distributed Ranked Search
Sort
View
SIGIR
2009
ACM
14 years 2 months ago
Counting ancestors to estimate authority
The AncestorRank algorithm calculates an authority score by using just one characteristic of the web graph—the number of ancestors per node. For scalability, we estimate the num...
Jian Wang, Brian D. Davison
SEMWEB
2004
Springer
14 years 1 months ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
SIGIR
2003
ACM
14 years 1 months ago
Beyond independent relevance: methods and evaluation metrics for subtopic retrieval
We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics ...
ChengXiang Zhai, William W. Cohen, John D. Laffert...
TREC
2007
13 years 9 months ago
Access to Legal Documents: Exact Match, Best Match, and Combinations
: In this paper, we document our efforts in participating to the TREC 2007 Legal track. We had multiple aims: First, to experiment with using different query formulations, trying t...
Avi Arampatzis, Jaap Kamps, Martijn Kooken, Nir Nu...
CIKM
2004
Springer
14 years 1 months ago
Processing search queries in a distributed environment
Endeca’s approach to processing search queries in a distributed computing environment is predicated on concerns of correctness, scalability, and flexibility in deployment. Using...
Frederick Knabe, Daniel Tunkelang