4171 search results - page 196 / 835 » Choice numbers of graphs |
191
click to vote
JMLR
2006
15 years 6 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
146
click to vote
IPPS
2007
IEEE
16 years 28 days ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
159
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
153
click to vote
VISSYM
2007
15 years 9 months ago
2007
Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a c...
197
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...