Sciweavers

537 search results - page 13 / 108
» Complete Performance Graphs in Probabilistic Information Ret...
Sort
View
IRI
2006
IEEE
14 years 1 months ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...
VALUETOOLS
2006
ACM
166views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Web graph analyzer tool
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
Konstantin Avrachenkov, Danil Nemirovsky, Natalia ...
SIGIR
2004
ACM
14 years 1 months ago
Retrieval evaluation with incomplete information
This paper examines whether the Cranfield evaluation methodology is robust to gross violations of the completeness assumption (i.e., the assumption that all relevant documents wi...
Chris Buckley, Ellen M. Voorhees
SIGIR
2008
ACM
13 years 7 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero
SIGIR
1998
ACM
13 years 12 months ago
A Language Modeling Approach to Information Retrieval
Abstract Models of document indexing and document retrieval have been extensively studied. The integration of these two classes of models has been the goal of several researchers b...
Jay M. Ponte, W. Bruce Croft