Sciweavers

784 search results - page 10 / 157
» Histogram-based search: A comparative study
Sort
View
CIKM
2006
Springer
13 years 10 months ago
Evaluation by comparing result sets in context
Familiar evaluation methodologies for information retrieval (IR) are not well suited to the task of comparing systems in many real settings. These systems and evaluation methods m...
Paul Thomas, David Hawking
CN
1999
73views more  CN 1999»
13 years 6 months ago
Measuring Index Quality Using Random Walks on the Web
Recent researchhas studied howto measurethe size of a searchengine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, name...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
SBBD
2004
82views Database» more  SBBD 2004»
13 years 8 months ago
Optimizing Ranking Calculation in Web Search Engines: a Case Study
Web search engines compete to offer the fastest responses with highest relevance. However, as Web collections grow, it becomes more difficult to achieve this purpose. As most user...
Miguel Costa, Mário J. Silva
AAAI
2000
13 years 8 months ago
Depth-First Branch-and-Bound versus Local Search: A Case Study
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
Weixiong Zhang
SIGIR
2010
ACM
13 years 10 months ago
Studying trailfinding algorithms for enhanced web search
Search engines return ranked lists of Web pages in response to queries. These pages are starting points for post-query navigation, but may be insufficient for search tasks involvi...
Adish Singla, Ryen White, Jeff Huang