Sciweavers

4820 search results - page 464 / 964
» Clustering Social Networks
Sort
View
NETWORKING
2010
15 years 8 months ago
Synapse: A Scalable Protocol for Interconnecting Heterogeneous Overlay Networks
This paper presents Synapse, a scalable protocol for information retrieval over the inter-connection of heterogeneous overlay networks. Applications on top of Synapse see those int...
Luigi Liquori, Cédric Tedeschi, Laurent Van...
TON
2008
109views more  TON 2008»
15 years 7 months ago
On hierarchical traffic grooming in WDM networks
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
Bensong Chen, George N. Rouskas, Rudra Dutta
BMCBI
2011
14 years 10 months ago
MINE: Module Identification in NEtworks
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
Kahn Rhrissorrakrai, Kristin C. Gunsalus
ADHOC
2007
139views more  ADHOC 2007»
15 years 7 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev...
INFOCOM
2000
IEEE
15 years 11 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong