Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports both in-place updates and large append-only (“log-structured”) write operations within the same storage volume, within the same B-tree, and even at the same time. The essence of the proposal is to make page migration in...

We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered tree pattern with internal structured variables, called a term tree, is a rooted tree pattern which consists of tree structures with ordered children and internal structured variables. A term tree is suited for repre...

A filter bank in which cyclic convolutions are used in place of linear convolutions will be referred to as a cyclic convolution filter bank (CCFB). A dyadic tree-structured CCFB can be used to perform a discrete wavelet transform suitable for coding based on symmetric extension methods. This paper derives an implementation technique for the tree-structured CCFB that can be realized by FFT proce...

By employing nonuniform nonunitary lter bank in an image coder increased performance in terms of both theoretical and practical (PSNR) coding gains, and subjective quality can be obtained. One possible candidate is octave-band tree-structured lter banks. In this paper, an optimized perfect reconstruction octave-band three-stage tree-structured lter bank is proposed. The lter coeecients are opti...

Highly developed science and technology from the last two decades motivated the study of complex data objects. In this paper, we consider the topological properties of a population of tree-structured objects. Our interest centers on modeling the relationship between a tree-structured response and other covariates. For tree objects, this poses serious challenges since most regression methods rel...

The aim of this section is to develop a high-performance semantic indexing system using Gaussian mixture model (GMM) supervectors and tree-structured GMMs [1, 2]. GMM spervectors corresponding to six types of audio and visual features are extracted from video shots by using tree-structured GMMs. The computational cost of maximum a posteriori (MAP) adaptation for estimating GMM parameters are re...

The tree-structured wavelet transform has received a lot of attention and has found successful applications in signal denoising, image coding, image analysis, etc. In this paper, we present an analysis of the structural stability of the tree-structured wavelet transform, a topic which has not been addressed properly in previous research. We also present a texture classification algorithm based ...

In this paper, we propose a signal prototype classi cation and evaluation framework in acoustic modeling. Based on this framework, a new tree-structured likelihood function is derived. It uses a designated cluster kernel f m for signal prototype classi cation and a designated cluster kernel f m for likelihood evaluation of outlier or tail events of the cluster. A minimum classi cation error (MC...

We show how alternating automata provide decision procedures for the equality of inductively de3ned Boolean functions and present applications to reasoning about parameterized families of circuits. We use alternating word automata to formalize families of linearly structured circuits and alternating tree automata to formalize families of tree structured circuits. We provide complexity bounds fo...

We develop a novel probabilistic approach for multi-label classification that is based on the mixtures-of-experts architecture combined with recently introduced conditional tree-structured Bayesian networks. Our approach captures different input-output relations from multi-label data using the efficient tree-structured classifiers, while the mixtures-of-experts architecture aims to compensate f...