123 search results - page 7 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
SPAA
2010
ACM
14 years 5 days ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
EUROPAR
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
NN
1997
Springer
13 years 11 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
ASUNAM
2011
IEEE
12 years 7 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
JOC
2006
13 years 7 months ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...