144 search results - page 15 / 29 » A speculation-friendly binary search tree |
AUSDM
2007
Springer
14 years 1 months ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
IJCAI
2007
13 years 9 months ago
2007
In this paper, we present a new decompositional approach for the extraction of propositional rules from feed-forward neural networks of binary threshold units. After decomposing t...
WACV
2012
IEEE
12 years 3 months ago
2012
IEEE
We present a novel algorithm, Compact Kd-Trees (CompactKdt), that achieves state-of-the-art performance in searching large scale object image collections. The algorithm uses an or...
SIGMETRICS
2004
ACM
14 years 1 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 ...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...