نتایج جستجو برای: d tree

تعداد نتایج: 737006  

Journal: :Concurrency and Computation: Practice and Experience 2012
Zeliu Ding Deke Guo Xue Liu Xueshan Luo Guihai Chen

Several novel data center network structures have been proposed to improve the topological properties of data centers. A common characteristic of these structures is that they are designed for supporting general applications and services. Consequently, these structures do not match well with the specific requirements of some dedicated applications. In this paper, we propose a hyper-fat-tree net...

Journal: :Int. J. Intell. Syst. 2001
Miguel Delgado Antonio F. Gómez-Skarmeta L. J. Linares

In this work, we present the induction of a fuzzy model that represents the behavior of a partial known function. We extend the approach of classical induction of a classifier by building a decision tree, and its generalization for regression problems by CART, to build a fuzzy model. It is defined by a collection of fuzzy regions fixed in the input domain of the function. To obtain fuzzy region...

Journal: :Int. J. Intell. Syst. 2005
Djamel A. Zighed Gilbert Ritschard Walid Erray Vasile-Marian Scuturici

Decision tree methods generally suppose that the number of categories of the attribute to be predicted is fixed. Breiman et al., with their Twoing criterion in CART, considered gathering the categories of the predicted attribute into two supermodalities. In this article, we propose an extension of this method. We try to merge the categories in an optimal unspecified number of supermodalities. O...

1999
Hans L. Bodlaender

In [DO95], Ding and Oporowski proved that for every k and d, every graph G = (V;E) with treewidth at most k and with maximum degree at most d has a tree decomposition of width at most max(600k2d3; 5400d3), such that every vertex v 2 V belongs to at most two of the sets associated to the nodes in the tree decomposition. Such a tree decomposition was called a domino tree decomposition by Bodlaend...

Journal: :international journal of environmental research 2014
s. ali ahmad korori m. matinizadeh a. shirvany e. madani mashaei t. talebi khorabadi

plane and mulberry trees play a crucial role in purifying the polluted air in tehran as a majorcity. in this research, 13 main districts of tehran city were chosen as study area. 20 completely healthy planeand mulberry species were selected in similar ecological conditions and age range. the uptake of cd and pbwas determined using spectrophotometry, whereas the chlorophyll content was measured ...

Journal: :Systems Engineering 2007
Edouard Kujawski Gregory A. Miller

This paper presents a realistic and practical approach to quantitatively assess the risk-reduction capabilities of military counterterrorism systems in terms of damage cost and casualty figures. The comparison of alternatives is thereby based on absolute quantities rather than an aggregated utility or value provided by multicriteria decision analysis methods. The key elements of the approach ar...

S. Abbasi S. Rahimi

ABSTRACT: In the present study, Persian gum, an exudate gum which secrets from the mountain almond tree (Amygdalus scoparia Spach) from two different regions is evaluated by means of chemical and instrumental analysis (fractionated by solving in water and alkaline solutions at 0.1, 0.5 and 1 M and also Smith degradation) using HPLC, 1H–NMR and 13C–NMR spectroscopy’s. The total sugar and uronic ...

Journal: :Electr. J. Comb. 2008
Domingos Dellamonica Yoshiharu Kohayakawa

An (n, d)-expander is a graph G = (V,E) such that for every X ⊆ V with |X| ≤ 2n− 2 we have |ΓG(X)| ≥ (d + 1)|X|. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any (n, d)-expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, ...

2007
Kien A. Hua Ying Cai Yu-Lung Lo

This paper shows how a domain-decomposition hierarchy can be organized as a paginated tree with a balanced height, which can be further extended to index the data subsets (i.e., rst-level indexing). The data in each subset can be indexed using any existing access support structure. (i.e., second-level indexing). We call this bi-level indexing structure \D-tree". D-tree has many desirable proper...

2005
Benjamin F. Clegg Willy Tinner Daniel G. Gavin Feng Sheng Hu

Lake sediments from arcto-boreal regions commonly contain abundant Betula pollen. However, palaeoenvironmental interpretations of Betula pollen are often ambiguous because of the lack of reliable morphological features to distinguish among ecologically distinct Betula species in western North America. We measured the grain diameters and pore depths of pollen from three tree-birch species (B. pa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید