We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
Abstract. This short note presents an efficient way to derive from an exponential Boltzmann sampler a ordinary Boltzmann sampler. Cette note rapide pr´esente une fa¸con efficace ...
-----------------------------------------------ABSTRACT----------------------------------------Computer system models provide detailed answer to system performance. In this paper a...
C. Chandra Sekhar Reddy, K. Ramakrishna Prasad, Ma...
----------------------------------------------ABSTRACT-------------------------------------------In the faceless world of the Internet, online fraud is one of the greatest reasons ...
-------------------------------------------ABSTRACT---------------------------------------In this paper, a new design of wireless sensor network (WSN) node is discussed which is ba...
In this work we present a prototype for simulating computer network attacks. Our objective is to simulate large networks (thousands of hosts, with applications and vulnerabilities)...
Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many...
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...
We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We dev...
The search task and the system both affect the demand on cognitive resources during information search. In some situations, the demands may become too high for a person. This arti...