This paper contains the proofs of the results of 1] not already contained there. We refer to 1] for notation. We deene a stronger ordering on trees than. We say that T2 is a blooming of T1, and we write T1 T2, if and only if T2 is obtained with a strict expansion of the divergent leaves of T1. More formally we deene: (G; ") (G; ") if not div(G) (G; ") (G; ~ t) if div(G) The interest in the bloo...

Immortal DB is a transaction time database system designed to enable high performance for temporal applications. It is built into a commercial database engine, Microsoft SQL Server. This paper describes how we integrated a temporal indexing technique, the TSB-tree, into Immortal DB to serve as the core access method. The TSB-tree provides high performance access and update for both current and ...

We propose to process coordination at the parsing level as a linguistic performance issue, outside the grammar, rather than as a matter of competence. We apply a specific algorithm to combine coordinated syntactic structures that were partially parsed using a coordinationless grammar, resulting in a directed acyclic parse graph in which constituent sharing appears sharply. This article presents...

We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S ( V ). We formalize it as the optimal multicast tree problem which is de ned as follows. Given a directed network G = (V;E) with a given source s and a set S of nodes, jV j = n and jEj = m. Associated with every link e 2 E, there is a set (e) of available wa...

The extraction of building inventory information is vital for damage assessment and planning modelling studies. In the last few years, conventional data was overcome using various remote sensing techniques. main objectives this study were to supply necessary structural engineers calculate seismic performance existing structures. Thus, we investigated light detection ranging (LiDAR) derivatives ...

Given a directed graph G and a sink vertex s, the directed minimum degree spanning tree problem requires computing an incoming spanning tree rooted at s whose maximum tree in-degree is the smallest among all such trees. The problem is known to be NP-hard, since it generalizes the Hamiltonian path problem. For the approximation version of this problem, a polynomial time algorithm with O(∆∗ logn)...

In modern life, interactions between human beings frequently occur in meetings, where topics are discussed. Semantic knowledge of meetings can be revealed by discovering interaction patterns from these meetings. An existing method mines interaction patterns from meetings using tree structures. However, such a tree-based method may not capture all kinds of triggering relations between interactio...

This paper proposes a video structure matching framework based on a tree matching algorithm which can be used as an effective video retrieval tool in a media management system. We define two types of specialized tree matching algorithms. The first is the non-ordered tree matching and the second is the ordered tree matching. The first algorithm is not constrained by the temporal ordering of the ...

1 An extremal problem on labelled directed trees A tree F is called a directed tree, if there is a direction on the edges, so that a vertex v0 (root) has only out-neighbours, and an arbitrary vertex v 6=v0 has a uniquely determined in-neighbour n(v). N(v) denotes the out-neighbourhood of v. The set of the leaves of a tree F is denoted by `(F ). Let U be a (finite) set. A tree F = F (U) is calle...

In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning out-tree with at most k vertices of reduced out-degree. This problem is a directed analog of the wellstudied Minimum-Vertex Feedback Edge Set problem. We show that this problem is fixed-parameter tractable and admits a...