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

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

Journal: :Computational Linguistics 2001

‎A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$‎. ‎The total domination number of a graph $G$‎, ‎denoted by $gamma_t(G)$‎, ‎is~the minimum cardinality of a total dominating set of $G$‎. ‎Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004)‎, ‎6...

Journal: :bulletin of the iranian mathematical society 0
m. krzywkowski department of pure and applied mathematics, university of johannesburg, south africa newline research fellow of the claude leon foundation. faculty of electronics, telecommunications and informatics, gdansk university of technology, poland.

‎a total dominating set of a graph $g$ is a set $d$ of vertices of $g$ such that every vertex of $g$ has a neighbor in $d$‎. ‎the total domination number of a graph $g$‎, ‎denoted by $gamma_t(g)$‎, ‎is~the minimum cardinality of a total dominating set of $g$‎. ‎chellali and haynes [total and paired-domination numbers of a tree, akce international ournal of graphs and combinatorics 1 (2004)‎, ‎6...

al. et E. Ebrahimi

The effects of initial spacing layout on some allometric characteristics of 12-year-old Quercus castaneifolia trees grown in Central Mazandaran, north of Iran were examined. Trees were planted in 5 different layouts (1?1, 1.5?1.5, 2?2.5, 2?3 and 4?4 m). Tree height, diameter at breast height, natural pruning height and the survival of trees were recorded in each sample plot. Tree basal area and...

1995
Owen Rambow K. Vijay-Shanker David J. Weir

DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two composition operations called subsertion and sisteradjunction. The most distinctive feature of DTG is that, unlike TAG, there is complete uniformity in the way that the two DTG operations relate lexical items: subsertion always corresponds to complementation and sister-adjunction to...

2007
Owen Rambow David Weir

In this paper we will describe a polynomial time Earley-style predictive parser for D-Tree Grammars (DTG). DTG were designed to share some of the advantages of TAG while overcoming some of its limitations. In developing parsers for TAG it has turned out to be useful to make use of a direct mapping from TAG to Linear Indexed Grammars (LIG) and to develop algorithms that work with the resulting L...

Journal: :Computational Linguistics 2001
Owen Rambow K. Vijay-Shanker David J. Weir

There is considerable interest among computational linguists in lexicalized grammatical frameworks; lexicalized tree adjoining grammar (LTAG) is one widely studied example. In this paper, we investigate how derivations in LTAG can be viewed not as manipulations of trees but as manipulations of tree descriptions. Changing the way the lexicalized formalism is viewed raises questions as to the des...

Journal: :caspian journal of environmental sciences 2012
al. et e. ebrahimi

the effects of initial spacing layout on some allometric characteristics of 12-year-old quercus castaneifolia trees grown in central mazandaran, north of iran were examined. trees were planted in 5 different layouts (1?1, 1.5?1.5, 2?2.5, 2?3 and 4?4 m). tree height, diameter at breast height, natural pruning height and the survival of trees were recorded in each sample plot. tree basal area and...

Journal: :bulletin of the iranian mathematical society 2011
m. mahmoudi a. mousivand a. tehranian

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

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