Sciweavers

11151 search results - page 35 / 2231
» On the Complexity of Model Expansion
Sort
View
ECIR
2007
Springer
13 years 9 months ago
Enhancing Expert Search Through Query Modeling
An expert finding is a very common task among enterprise search activities, while its usual retrieval performance is far from the quality of the Web search. Query modeling helps t...
Pavel Serdyukov, Sergey Chernov, Wolfgang Nejdl
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
13 years 11 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
CIKM
2009
Springer
14 years 2 months ago
Improving retrievability of patents with cluster-based pseudo-relevance feedback documents selection
High findability of documents within a certain cut-off rank is considered an important factor in recall-oriented application domains such as patent or legal document retrieval. ...
Shariq Bashir, Andreas Rauber
SIGIR
2008
ACM
13 years 7 months ago
A few examples go a long way: constructing query models from elaborate query formulations
We address a specific enterprise document search scenario, where the information need is expressed in an elaborate manner. In our scenario, information needs are expressed using a...
Krisztian Balog, Wouter Weerkamp, Maarten de Rijke
TREC
2007
13 years 8 months ago
Information Retrieval and Information Extraction in TREC Genomics 2007
In TREC Genomics a question/answering task has been proposed. A set of questions with a specific entity of interest is proposed and a set of passages from a collection of full te...
Antonio Jimeno-Yepes, Piotr Pezik