Trees “Pierced” by other Trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Outlier Detection by Boosting Regression Trees

A procedure for detecting outliers in regression problems is proposed. It is based on information provided by boosting regression trees. The key idea is to select the most frequently resampled observation along the boosting iterations and reiterate after removing it. The selection criterion is based on Tchebychev’s inequality applied to the maximum over the boosting iterations of ...

متن کامل

Embeddings and Other Mappings of Rooted Trees Into Complete Trees

Let Tn be the complete binary tree of height n, with root 1n as the maximum element. For T a tree, define A(n;T ) = |{S ⊆ Tn : 1n ∈ S, S ∼= T}| and C(n;T ) = |{S ⊆ Tn : S ∼= T}|. We disprove a conjecture of Kubicki, Lehel and Morayne, which claims that A(n;T1) C(n;T1) ≤ A(n;T2) C(n;T2) for any fixed n and arbitrary rooted trees T1 ⊆ T2. We show that A(n;T ) is of the form ∑l j=0 qj(n)2 jn where...

متن کامل

The Average Height of Binary Trees and Other Simple Trees

The average height of a binary tree with n internal nodes is shown to be asymptotic to 2 6. This represents the average stack height of the simplest recursive tree traversal algorithm. The method used in this estimation is also applicable to the analysis of traversal algorithms of unary-binary trees, unbalanced 2-3 trees, t-ary trees for any t, and other families of trees. It yields the two pre...

متن کامل

Approximation of trees by self-nested trees

The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of trees. We show that self-nested trees may be considered as an approximation class of unordered trees. We compare our approximation algorithms with a competitive ...

متن کامل

One-Sided Interval Trees

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1874

ISSN: 0028-0836,1476-4687

DOI: 10.1038/009501a0