Bottleneck Steiner tree problem asks to find a Steiner tree for n terminals with at most k Steiner points such that the length of the longest edge in the tree is minimized. The problem has applications in the design of wireless communication networks. In this paper we study a restricted version of the bottleneck Steiner tree problem in the Euclidean plane which requires that only degree-2 Stein...

The Krushkal polynomial is the most general polynomial invariant of graphs on surfaces. It was introduced in [1]. A collection of edges forms a spanning quasi-tree if the regular neighborhood of the corresponding spanning subgraph has one boundary component. In the case of plane graphs it is just a spanning tree. The set of edges of a spanning quasi-trees is a feasible set of the corresponding ...

Real-time performance is a very important goal for embedded speech recognition systems, where the evaluation of likelihoods for Gaussian mixture models (GMM) usually dominates the computation of a continuous density hidden Markov model (CDHMM) based system. The Bucket Box Intersection (BBI) algorithm is an optimization technique that uses a K-Dimensional binary tree to speed up the score comput...

--In this paper, we present region-based coding of medical images using integer wavelet transforms and the modified SPMT algorithm. Our method differs from previously reported region-ofinterest (ROI) coders in such a way that the regionbased integer wavelet transform is used to obtain the representation of the partitioned image plane rather than differentiating the coefficients associated with ...

Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial order structure to the set of nodes: that allows us to visualise a node as a rectangle in the plane rather than as a point, letting us use the containment relation to express structure additional to that given by a tr...

---~Y(z) = ~(Y(z)), which is non linear and autonomous. Singularity analysis applied to the intervening generating functions then permits to analyze asymptotically a number of parameters of the trees, like: root degree, number of leaves, path length, and level of nodes. In this way it is found that various models share common features: path length is O(n log n), the distribution of node levels ...

This paper has provided the first set of quantitative data of diffuse erythemal UV and UVA in tree shade at a sub-tropical Southern Hemisphere latitude. Over the summer, approximately 60% of the erythemal UV radiation in the tree shade is due to the diffuse component. Similarly, approximately 56% of the UVA radiation in the tree shade is due to the diffuse component. In the tree shade these dif...

A rectilinear Steiner tree for a set T of points in the plane is a tree which connects T using horizontal and vertical lines, In the Rectilinear Steiner Tree problem, input is a set T of n points in the Euclidean plane (R) and the goal is to find an rectilinear Steiner tree for T of smallest possible total length. A rectilinear Steiner arborecence for a set T of points and root r ∈ T is a recti...

The fraction and the distribution of the personal daily solar erythemal UV exposure were assessed for the shade provided by Australian gum trees in each of the four seasons to allow evaluation of the reduction in the personal UV exposure in tree shade over a year. The personal annual erythemal UV exposures in the tree shade ranged from 2,510 SED (Standard Erythema Dose) for the vertical part of...