234 search results - page 39 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
79
Voted
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
EMO
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
SPAA
1998
ACM
15 years 1 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
ALGORITHMICA
2004
14 years 9 months ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...