Abstract. We present a detailed study of left-right-imbalance measures for random binary search trees under the random permutation model, i.e., where binary search trees are generated by random permutations of {1, 2, . . . , n}. For random binary search trees of size n we study (i) the difference between the left and the right depth of a randomly chosen node, (ii) the difference between the lef...

The design and manufacture of complex Engineer-to-Order products is characterised by uncertain operation durations, finite capacity resources and multilevel product structures. Two scheduling methods are presented to minimise expected costs for multiple products across multiple finite capacity resources. The first sub-optimises the operations sequence, using mean operation durations, then refin...

Many foraging animals find food using composite random search strategies, which consist of intensive and extensive search modes. Models of composite search can generate predictions about how optimal foragers should behave in each search mode, and how they should determine when to switch between search modes. Most of these models assume that foragers use resource encounters to decide when to swi...

We study the profile Xn,k of random search trees including binary search trees and m-ary search trees. Our main result is a functional limit theorem of the normalized profile Xn,k/EXn,k for k = α logn in a certain range of α. A central feature of the proof is the use of the contraction method to prove convergence in distribution of certain random analytic functions in a complex domain. This is ...

The detection of moving objects like vehicles, pedestrians or bicycles from a mobile platform is one of the most challenging and most important tasks for driver assistance and safety systems. For this purpose, we present a multi-class traffic scene segmentation approach based on the Dynamic Stixel World, an efficient super-pixel object representation. In this approach, each Stixel is assigned e...

We explore the use of conditional random fields (CRFs) to automatically extract important metadata from clinical research articles. These metadata fields include formulaic metadata about the authors, extracted from the title page, as well as free text fields concerning the study’s critical parameters, such as longitudinal variables and medical intervention methods, extracted from the body text ...

Genomics studies routinely depend on similarity searches based on the strategy of finding short seed matches (contiguous k bases) which are then extended. The particular choice of the seed length, k, is determined by the tradeoff between search speed (larger k reduces chance hits) and sensitivity (smaller k finds weaker similarities). A novel idea of using a single deterministic optimized space...

Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has been given, which shows our algorithm can have fewer comparisons than the best known solution by at least a factor of 0.27 under random graph model. Experimental results have also been given, which suggest the advantage ...

Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is ar_md that tim similarities of candidate solut...