Sciweavers

342 search results - page 17 / 69
» Branch-and-bound processing of ranked queries
Sort
View
VLDB
1999
ACM
127views Database» more  VLDB 1999»
13 years 11 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano
AMR
2005
Springer
128views Multimedia» more  AMR 2005»
14 years 1 months ago
Ranking Invariance Based on Similarity Measures in Document Retrieval
Abstract. To automatically retrieve documents or images from a database, retrieval systems use similarity measures to compare a request based on features extracted from the documen...
Jean-François Omhover, Maria Rifqi, Marcin ...
SEMWEB
2009
Springer
14 years 2 months ago
Towards Lightweight and Robust Large Scale Emergent Knowledge Processing
We present a lightweight framework for processing uncertain emergent knowledge that comes from multiple resources with varying relevance. The framework is essentially RDF-compatibl...
Vít Novácek, Stefan Decker
WISE
2005
Springer
14 years 1 months ago
Document Re-ranking by Generality in Bio-medical Information Retrieval
Document ranking is well known to be a crucial process in information retrieval (IR). It presents retrieved documents in an order of their estimated degrees of relevance to query. ...
Xin Yan, Xue Li, Dawei Song
ICEIS
2009
IEEE
14 years 2 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke