Báo cáo khoa học: Rectilinear spanning trees versus bounding boxes pot

... Rectilinear spanning trees versus bounding boxes D. Rautenbach Forschungsinstitut f¨ur Diskrete Mathematik, Universit¨at ... ) ≤ 1 √ 2 √ n + 3 2 where mst(P ) is the minimum total length of a rectilinear spanning tree for P and bb(P ) is half the perimeter of the bounding box of P . Since the constant 1 √ 2 in the above bound ... P ⊆ R 2 let mst(P ) be the minimum total leng...

Ngày tải lên: 07/08/2014, 08:20

... rather differently. 4 Formal Framework The framework underlying both ID and LP trees is the configuration of labeled trees under valency (and other) constraints. Consider a finite set L of edge labels, ... constraining tree structures: un- ordered, non-projective ID trees which capture purely syntactic dependencies, and ordered, pro- jective LP trees which capture topological depen- den...

Ngày tải lên: 20/02/2014, 18:20

... rearrangements of special constructs, as is the case of NP-SBJ PP NP-PRD versus AuxP AuxP Sb nodes and their subtrees. More discussion follows. 1.4 Outline of the transformation The two tree ... in- evitable. 2.3 Tree post-processing Completion of the dependency tree also involves pruning of subtrees which are co-indexed with some trace, and attaching them in place of the re- ferring trac...

Ngày tải lên: 22/02/2014, 02:20

... about trees, and an extension L'r(L F) for talking about trees decorated with feature struc- tures. From a logical point of view this is a nat- ural thing to do. After all, the trees ... the G parse trees. However we want to capture all and only the parse trees for G. This is easily done: we need merely express in our language certain general facts about parse trees. Firs...

Ngày tải lên: 22/02/2014, 10:20

... regenerate the trees according to the new specifications without manually touching the trees. The bracketing information will persist through the updates and the basic structure of the trees will ... information to help rank the trees. During tree ranking, the brackets of each tree are compared with the brackets in the cantillation trees to find the number of mismatches. Tree...

Ngày tải lên: 08/03/2014, 02:21

... small “elementary trees (ab- breviated “etrees” in the rest of this paper) that are the “building blocks” of the full trees of a treebank. This decomposition of the full tree into etrees also results ... full discussion here, but the etrees and derivation trees as just described require refine- ment to be truly appropriate for comparing nuclei. The reason is that etrees might encode more...

Ngày tải lên: 17/03/2014, 00:20

Ngày tải lên: 17/03/2014, 19:20

... Combining Decision Trees by Ada-boost Algorithm The final probability set h I is then computed by mixing T trees according to their perfor- mance (4 in Table 2). Using h: instead of PoT( yeslbi ... rule (1). It is of course reasonable to normalize class frequencies instead of the probability PoT( yeslbi, bj,, f,, , fro). Equa- tion (1) tends to emphasize long distance dependen...

Ngày tải lên: 23/03/2014, 19:20

... Strings and Trees Like many approaches to formalization of natural language syntax, TAG is based on a hierarchical de- composition of strings which is represented by or- dered trees. (Figure 1.) These trees ... complicated wrapping pattern that occurs in the wh-form of the raising verb trees is to move to a formalism in which the spine languages of the derived trees are TALs (the str...

Ngày tải lên: 31/03/2014, 03:20

... the spanning trees in the directional model and in the Schreier model, are different. 3 Spanning trees on the Schr eier graphs of the Hanoi Towers group In this section, we study spanning trees ... show that a spanning 2-forest of type U n+1 can be obtained starting from three spanning trees of level n (in this case we omit two exceptional edges), but also by taking two span...

Ngày tải lên: 08/08/2014, 12:23