Sciweavers

621 search results - page 13 / 125
» Learning to Distribute Queries into Web Search Nodes
Sort
View
MIDDLEWARE
2004
Springer
15 years 2 months ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
15 years 10 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
SIGIR
2011
ACM
14 years 10 days ago
Pseudo test collections for learning web search ranking functions
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
Nima Asadi, Donald Metzler, Tamer Elsayed, Jimmy L...
101
Voted
PDP
2010
IEEE
15 years 4 months ago
Scheduling Metric-Space Queries Processing on Multi-Core Processors
Abstract—This paper proposes a strategy to organize metricspace query processing in multi-core search nodes as understood in the context of search engines running on clusters of ...
Veronica Gil Costa, Ricardo J. Barrientos, Maurici...
82
Voted
HPDC
2005
IEEE
15 years 3 months ago
Dynamic load balancing for distributed search
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...