450 search results - page 52 / 90 » Estimating Search Tree Size |
161
click to vote
IR
2008
15 years 6 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
169
click to vote
ICDT
2001
ACM
15 years 10 months ago
2001
ACM
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
142
click to vote
DEXA
1998
Springer
15 years 10 months ago
1998
Springer
The object identifier index of an object-oriented database system is typically 20% of the size of the database itself, and for large databases, only a small part of the index fits...
165
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Individuals often use search engines to return to web pages they have previously visited. This behaviour, called refinding, accounts for about 38% of all queries. While researcher...
264
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...