Sciweavers

522 search results - page 32 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
132
Voted
DIS
2009
Springer
15 years 6 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
119
Voted
IJCBDD
2010
127views more  IJCBDD 2010»
15 years 1 months ago
Predicting protein complexes by data integration of different types of interactions
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...
CCS
2008
ACM
15 years 5 months ago
Measuring network security using dynamic bayesian network
Given the increasing dependence of our societies on networked information systems, the overall security of these systems should be measured and improved. Existing security metrics...
Marcel Frigault, Lingyu Wang, Anoop Singhal, Sushi...
ALENEX
2004
121views Algorithms» more  ALENEX 2004»
15 years 4 months ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...
AAAI
2006
15 years 4 months ago
Factored Planning: How, When, and When Not
Automated domain factoring, and planning methods that utilize them, have long been of interest to planning researchers. Recent work in this area yielded new theoretical insight an...
Ronen I. Brafman, Carmel Domshlak