1666 search results - page 38 / 334 » Effective and efficient structured retrieval |
PODS
2006
ACM
14 years 7 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
RIAO
2000
13 years 9 months ago
2000
Given a set of categories, with or without a preexisting hierarchy among them, we consider the problem of assigning documents to one or more of these categories from the point of ...
CIKM
1998
Springer
13 years 12 months ago
1998
Springer
In this paper, a signature file method for indexing document database systems is presented. For this purpose, the concept of presentative word hierarchy is introduced, based on whi...
DCC
1999
IEEE
13 years 12 months ago
1999
IEEE
We report on the performance evaluation of greedy parsing with a single step lookahead, denoted as flexible parsing. We also introduce a new fingerprint based data structure which...
ACIVS
2008
Springer
13 years 9 months ago
2008
Springer
Content-Based Image Retrieval is a challenging problem both in terms of effectiveness and efficiency. In this paper, we present a flexible cluster-and-search approach that is able ...