The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
We propose new types of linguistic summaries of time-series data that extend those proposed in our previous papers. The proposed summaries of time series refer to the summaries of...
Abstract In this paper, we present a segmentation algorithm which partitions a mesh based on the premise that a 3D object consists of a core body and its constituent protrusible pa...
Alexander Agathos, Ioannis Pratikakis, Stavros J. ...
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
Xianyue Li, Xiao-Hua Xu, Feng Zou, Hongwei Du, Pen...