Coverage problem is essential to Wireless Sensor Networks on energy efficient deployment and monitoring. In this paper, we propose a distributed Čech complex algorithm for coverage hole detection in WSNs. Based on our...
详细信息
Technologic evolution,in the field of communication by using network computers,gives appropriate solutions to implement parallel algorithms in order to achieve high speed applications. In this paper,we show how the im...
详细信息
Technologic evolution,in the field of communication by using network computers,gives appropriate solutions to implement parallel algorithms in order to achieve high speed applications. In this paper,we show how the implementation of a matrix multiplication on a network computers can be accomplished using the MPI(Message Passing Interface) standard. We presents an analysis concerning to the time necessary for two different implementations of matrix multiplication: one is a sequential implementation and another is a distributed(parallel) implementation. We analyses the performances of the parallel algorithms. The only real requirement is that the matrix used in the multiplication is square. Our experimental platform includes the homogeneous Intel computers and the implementation of application is achieved using the MPI standard. Based on our experiments,we extract useful conclusions that can serve as guidelines for the optimization process of the matrix multiplication.
In this paper we face the inexact graph matching problem from the parallel algorithms viewpoint. After a brief introduction of both graph matching and parallel computing contexts, we discuss a specific method of perfo...
详细信息
ISBN:
(纸本)9781467314886
In this paper we face the inexact graph matching problem from the parallel algorithms viewpoint. After a brief introduction of both graph matching and parallel computing contexts, we discuss a specific method of performing inexact graph matching based on the well known tensor product operator. We analyze the problem using two parallel computing models, following different algorithmic strategies, and performing also an experimental evaluation. The aim of this paper is to provide modeling and algorithmic strategies to extend inexact graph matching methods to graphs of high order and size, conceiving the computational problem in the more wider context of graph-based Pattern Recognition and Soft Computing systems. As a whole, the obtained results encourage more effort on this direction.
The well-known k-disjoint path problem (k-DPP) asks for pairwise vertex-disjoint paths between k specified pairs of vertices (si,ti) in a given graph, if they exist. The decision version of the shortest k-DPP asks for...
详细信息
Considering that the spectrum resources are becoming increasingly demand, maximum channel capacity is very crucial for future wireless communication systems, especially for cognitive radio networks (CRNs). However, mo...
详细信息
Artificial Neural Network is an effective technique of prediction needing a lot of time for training. Benefitting from data parallelization and structure parallelization, training time of network has been greatly redu...
详细信息
Image restoration is a very common process in present and mainly consist in attempts to recover an image that has been degraded, by altering some areas or data missing and as a result a lot of algorithms have been pro...
详细信息
Many time series analytical problems arising in a wide spectrum of data intensive applications require subsequence similarity search as a subtask. Currently, Dynamic Time Warping (DTW) is considered as the best simila...
详细信息
The Leader Election Algorithm is used to select a specific node in distributed systems. In the case of Wireless Sensor Networks, this node can be the one having the maximum energy, the one situated on the extreme left...
详细信息
The developed method of synthesis of empirical models using the genetic algorithms significantly reduces the computing time for implementing empirical models comparing with the inductive method of selforganizing model...
详细信息
暂无评论