1376 search results - page 72 / 276 » Searching Trees: An Essay |
RIAO
2000
15 years 1 months ago
2000
Traditionally work on multimedia structuring has been centered on the creation of indices and their use for searching. Although searching is important there are many cases where t...
109
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
CIKM
2009
Springer
15 years 3 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
107
click to vote
ENTCS
2008
14 years 12 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
ACTA
2008
14 years 10 months ago
2008
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...