Limit laws for several quantities in random binary search trees that are related to the local shape of a tree around each node can be obtained very simply by applying central limit theorems for rn-dependent random variables . Examples include : the number of leaves (La ), the number of nodes with k descendants (k fixed), the number of nodes with no left child, the number of nodes with k left de...

In this paper, a new approach (scheme) to the analysis of quad-trees in the discrete wavelet spectrum of a digital image is proposed. During the pre-scanning phase, the proposed scheme generates problem-oriented binary codes for the whole set of quad-tree roots (wavelet coefficients) and thereby accumulates information on the significance of respective descendants (wavelet coefficients comprisi...

As a very effective method for universal purpose pattern recognition, support vector machine (SVM) was proposed for dichotomic classification problem, which exhibits a remarkable resistance to overfitting, a feature explained by the fact that it directly implements the principle of structural risk minimization. However, in real world, most of classification problems consist of multiple categori...

2 Binary search trees 2 2.1 Definition of a binary search tree . . . . . . . . . . . . . . . . . . 2 2.2 Profile of a binary search tree . . . . . . . . . . . . . . . . . . . . 3 2.2.1 Level polynomial. BST martingale . . . . . . . . . . . . . 3 2.2.2 Embedding in continuous time. Yule tree . . . . . . . . . . 6 2.2.3 Connection Yule tree binary search tree . . . . . . . . . . 7 2.2.4 Asymptoti...

Oblivious RAM (ORAM) has received increasing attention in the past few years. The goal of oblivious RAM is to enable a client, that can locally store only a small (preferably constant) amount of data, to store remotely N data items, and access them while hiding the identities of the items that are being accessed. Most of the earlier ORAM constructions were based on the hierarchical data structu...

Unlike the simplification of independent line features, the generalization of terrain contour is to handle the “line group”, which describes the geomorphologic characteristics, such as the terrain valley and ridge. In decision level, the real operation object in terrain generalization is not line segment itself but the drainage network contained in the contour representation. This paper present...

UNLABELLED This paper examines a new technique for the visualization of and the interaction with trees, objects frequently used to convey hierarchical relationships in biological data. Motivated by the quality of 2D tree interaction, we adapt the planar tree-of-life metaphor to a virtual, semi-immersive 3D environment. A 3D environment extends the utility of this metaphor by allowing the user t...

Trees like binary-space-partitioning trees, kd-trees, principal axis trees and random projection trees are used to answer the question ”which tree to use for nearest-neighbor search?.” This paper deals with the influence of the vector quantization performance of the trees on the search performance and the margins of the partitions in these trees. Theoretical results show that both factors have ...

In this paper, a dynamic gesture recognition system is presented which requires no special hardware other than a Webcam. The system is based on a novel method combining Principal Component Analysis (PCA) with hierarchical multi-scale theory and Discrete Hidden Markov Models (DHMM). We use a hierarchical decision tree based on multiscale theory. Firstly we convolve all members of the training da...