Sciweavers

683 search results - page 71 / 137
» Graph Annotations in Modeling Complex Network Topologies
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 2 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
CONEXT
2007
ACM
15 years 1 months ago
Internet routing resilience to failures: analysis and implications
Internet interdomain routing is policy-driven, and thus physical connectivity does not imply reachability. On average, routing on today's Internet works quite well, ensuring ...
Jian Wu, Ying Zhang, Zhuoqing Morley Mao, Kang G. ...
94
Voted
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
14 years 8 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
DIS
2009
Springer
15 years 1 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda