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...
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...
: 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 ...
—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 ...
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 ...