234 search results - page 17 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
112
click to vote
PAMI
2011
14 years 4 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
106
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
DEXA
2008
Springer
14 years 11 months ago
2008
Springer
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
SIGMETRICS
2004
ACM
15 years 3 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...