A discrete uncoupling process for finite spaces is introduced, called the Markov Cluster
Process or the MCL process. The process is the engine for the graph clustering algorithm …

Wireless sensor networks (WSNs) for environment monitoring consist of a large number of
low-cost battery-powered sensors nodes, densely deployed throughout a remote or …

The aim of graph clustering is to define compact and well-separated clusters from a given
graph. Cluster's compactness depends on datasets and clustering methods. In order to …

The current approach in web searching, ie, using centralized search engines, rises issues
that question their future applicability: 1) coverage and scalability, 2) freshness, and 3) …

In this paper a information hiding algorithm applied to compressed speech bitstream is
proposed. Covering codes are used to hide information in the least important bits in G. 729 …

A distributed software system's deployment architecture can have a significant impact on the
system's properties. These properties will depend on various system parameters, such as …

Purpose–The purpose of this paper is to present an approach for the decentralization of
swarm intelligence algorithms that run on computing systems with autonomous components …

Peer-to-peer (P2P) has become an important computing model because of its adaptation,
self-organization and autonomy etc. But efficient organization of the nodes in P2P networks …

Clustering involves arranging a P2P overlay network's topology so that peers having certain
characteristics are grouped together as neighbors. Clustering can be used to organize a …

Data transfer amongst peers in a network without a central authority to regulate traffic, is on
the ascendancy in the recent years. In this paper, we propose a k-clique based overlay …