Sciweavers

341 search results - page 44 / 69
» Paired bondage in trees
Sort
View
GD
2007
Springer
15 years 3 months ago
Line Crossing Minimization on Metro Maps
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
ISPAN
2005
IEEE
15 years 3 months ago
Coordinated Robust Routing by Dual Cluster Heads in Layered Wireless Sensor Networks
In this paper, we propose the coordinated robust routing (CRR) scheme to address the fault tolerance requirements in the layered wireless sensor networks. In the proposed scheme, ...
Mei Yang, Jianping Wang, Zhen-guo Gao, Yingtao Jia...
ICDCS
2002
IEEE
15 years 2 months ago
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
Thiagaraja Gopalsamy, Mukesh Singhal, Dhabaleswar ...
ICAPR
2009
Springer
15 years 2 months ago
Multisensor Biometric Evidence Fusion for Person Authentication Using Wavelet Decomposition and Monotonic-Decreasing Graph
—This paper presents a novel biometric sensor generated evidence fusion of face and palmprint images using wavelet decomposition for personnel identity verification. The approach...
Dakshina Ranjan Kisku, Jamuna Kanta Sing, Massimo ...
STACS
2001
Springer
15 years 2 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid