We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
Anthony Schmieder, Howard Cheng, Barry Gergel, Xia...
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
In group communication, users often have different access rights to multiple data streams. Based on the access relation of users and data streams, users can form partially ordered...
Abstract--In this paper we present an information visualization approach for visualizing the intersection between multiple feature hierarchies. In cases where a dataset has multipl...