Sciweavers

342 search results - page 21 / 69
» Branch-and-bound processing of ranked queries
Sort
View
SIGIR
2002
ACM
13 years 7 months ago
Finding relevant documents using top ranking sentences: an evaluation of two alternative schemes
In this paper we present an evaluation of techniques that are designed to encourage web searchers to interact more with the results of a web search. Two specific techniques are ex...
Ryen White, Ian Ruthven, Joemon M. Jose
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 9 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
ICMCS
2006
IEEE
124views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Combining Textual and Visual Ontologies to Solve Medical Multimodal Queries
In order to solve medical multimodal queries, we propose to split the queries in different dimensions using ontology. We extract both textual and visual terms depending on the ont...
Saïd Radhouani, Joo-Hwee Lim, Jean-Pierre Che...
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
12 years 10 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
IR
2010
13 years 6 months ago
LETOR: A benchmark collection for research on learning to rank for information retrieval
LETOR is a benchmark collection for the research on learning to rank for information retrieval, released by Microsoft Research Asia. In this paper, we describe the details of the L...
Tao Qin, Tie-Yan Liu, Jun Xu, Hang Li