Sciweavers

17 search results - page 1 / 4
» Top-K Color Queries for Document Retrieval
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 1 months ago
Top-K Color Queries for Document Retrieval
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Marek Karpinski, Yakov Nekrich
CIKM
2011
Springer
12 years 7 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
SPIRE
2010
Springer
13 years 5 months ago
Colored Range Queries and Document Retrieval
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi
JASIS
2010
124views more  JASIS 2010»
13 years 5 months ago
Query polyrepresentation for ranking retrieval systems without relevance judgments
Ranking information retrieval (IR) systems with respect to their effectiveness is a crucial operation during IR evaluation, as well as during data fusion. This paper offers a no...
Miles Efron, Megan A. Winget
ICTIR
2009
Springer
13 years 4 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette