Sciweavers

5922 search results - page 717 / 1185
» Navigability of Complex Networks
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
VLSID
2004
IEEE
170views VLSI» more  VLSID 2004»
16 years 7 months ago
On-chip networks: A scalable, communication-centric embedded system design paradigm
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
Jörg Henkel, Srimat T. Chakradhar, Wayne Wolf
WWW
2010
ACM
16 years 2 months ago
Measurement-calibrated graph models for social network experiments
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
Alessandra Sala, Lili Cao, Christo Wilson, Robert ...
ISPASS
2009
IEEE
16 years 2 months ago
Evaluating GPUs for network packet signature matching
Modern network devices employ deep packet inspection to enable sophisticated services such as intrusion detection, traffic shaping, and load balancing. At the heart of such servi...
Randy Smith, Neelam Goyal, Justin Ormont, Karthike...
APNOMS
2009
Springer
16 years 2 months ago
A Scheme for Supporting Optimal Path in 6LoWPAN Based MANEMO Networks
In this paper, we focus on the scheme for the route optimization in 6LoWPAN based MANEMO environments. If 6LoWPAN mobile routers for supporting NEMO protocol are organized by neste...
Jin Ho Kim, Choong Seon Hong