Sciweavers

841 search results - page 81 / 169
» Approximability of Minimum AND-Circuits
Sort
View
JCO
2006
103views more  JCO 2006»
13 years 10 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
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...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
MP
2006
84views more  MP 2006»
13 years 10 months ago
Optimal 3-terminal cuts and linear programming
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...
FSS
2008
126views more  FSS 2008»
13 years 8 months ago
Linguistic summarization of time series using a fuzzy quantifier driven aggregation
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...
Janusz Kacprzyk, Anna Wilbik, Slawomir Zadrozny
VC
2010
207views more  VC 2010»
13 years 8 months ago
Protrusion-oriented 3D mesh segmentation
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. ...
COCOA
2009
Springer
14 years 4 months ago
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
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...