1729 search results - page 242 / 346 » Bound Graph Polysemy |
208
click to vote
JMLR
2010
15 years 26 days ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
170
click to vote
FCT
2009
Springer
16 years 19 days ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di...
155
click to vote
CDC
2008
IEEE
16 years 17 days ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
124
click to vote
FOCS
2008
IEEE
16 years 16 days ago
2008
IEEE
We prove that any graph G with n points has a distribution T over spanning trees such that for any edge (u, v) the expected stretch ET ∼T [dT (u, v)/dG(u, v)] is bounded by ˜O(...
186
click to vote
AI
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...