829 search results - page 40 / 166 » Minimal document set retrieval |
WWW
2010
ACM
14 years 5 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
ECIR
2009
Springer
14 years 7 months ago
2009
Springer
: In the last decade, many evaluation results have been created within the evaluation initiatives like TREC, NTCIR and CLEF. The large amount of data available has led to substanti...
SBBD
2008
13 years 11 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
CDES
2006
13 years 11 months ago
2006
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
WWW
2008
ACM
14 years 10 months ago
2008
ACM
As opposed to representing a document as a "bag of words" in most information retrieval applications, we propose a model of representing a web page as sets of named enti...