2210 search results - page 188 / 442 » CLEF 2001 - Overview of Results |
149
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
132
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
162
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophis...
130
click to vote
ICIAP
2001
Springer
16 years 6 months ago
2001
Springer
Stripes are common sub-structures of text characters, and the scale of these stripes varies little within a word. This scale consistency thus provides us with a useful feature for...
180
click to vote
ICIAP
2001
Springer
16 years 6 months ago
2001
Springer
In this paper the development of an intelligent image content-based search engine for the World Wide Web is presented. Information Web Crawlers continuously traverse the Internet ...