Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
This paper considers the problem of selecting either routes that consist of long hops or routes that consist of short hops in a network of multiple-antenna nodes, where each trans...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
Novelty detection in time series is an important problem with application in different domains such as machine failure detection, fraud detection and auditing. An approach to this...
Adriano L. I. Oliveira, Fernando Buarque de Lima N...