750 search results - page 45 / 150 » Reconstruction for Models on Random Graphs |
UAI
2004
15 years 4 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
142
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
118
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
124
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
124
Voted
ACL
2010
15 years 1 months ago
2010
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...