Sciweavers

9683 search results - page 1328 / 1937
» Predicting query performance
Sort
View
BMCBI
2011
14 years 10 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
SIGIR
2011
ACM
14 years 10 months ago
The economics in interactive information retrieval
Searching is inherently an interactive process usually requiring numerous iterations of querying and assessing in order to find the desired amount of relevant information. Essent...
Leif Azzopardi
CIKM
2011
Springer
14 years 7 months ago
Tractable XML data exchange via relations
We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document a...
Rada Chirkova, Leonid Libkin, Juan L. Reutter
CIKM
2011
Springer
14 years 7 months ago
Lower-bounding term frequency normalization
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
Yuanhua Lv, ChengXiang Zhai
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
14 years 2 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
« Prev « First page 1328 / 1937 Last » Next »