Sciweavers

194 search results - page 35 / 39
» Reconstructing Randomized Social Networks
Sort
View
NIPS
2008
13 years 9 months ago
Non-stationary dynamic Bayesian networks
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
Joshua W. Robinson, Alexander J. Hartemink
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot
ICDCS
2010
IEEE
13 years 11 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 12 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
BMCBI
2005
178views more  BMCBI 2005»
13 years 7 months ago
A quantization method based on threshold optimization for microarray short time series
Background: Reconstructing regulatory networks from gene expression profiles is a challenging problem of functional genomics. In microarray studies the number of samples is often ...
Barbara Di Camillo, Fatima Sanchez-Cabo, Gianna To...