Sciweavers

82 search results - page 7 / 17
» Modularity-Driven Clustering of Dynamic Graphs
Sort
View
ICC
2008
IEEE
167views Communications» more  ICC 2008»
14 years 2 months ago
Clustering Large Optical Networks for Distributed and Dynamic Multicast
—For a large-scale mesh network with dynamic traffic, maintaining the global state information in a centralized fashion is impractical. Hence, distributed schemes are needed to ...
Mohammad Masud Hasan, Jason P. Jue
ICPP
2009
IEEE
14 years 2 months ago
SkipStream: A Clustered Skip Graph Based On-demand Streaming Scheme over Ubiquitous Environments
Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the stringent QoS requirements of streaming service as ...
Qifeng Yu, Tianyin Xu, Baoliu Ye, Sanglu Lu, Daoxu...
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 7 months ago
The Naming Game in Social Networks: Community Formation and Consensus Engineering
We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat. Mech.: Theory Exp. P06014] in empirical social networks. This stylized agentbased model captures essen...
Qiming Lu, Gyorgy Korniss, Boleslaw K. Szymanski
IGIS
1994
156views GIS» more  IGIS 1994»
13 years 11 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 14 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...