3008 search results - page 31 / 602 » Independence in connected graphs |
78
Voted
ICALP
2009
Springer
16 years 29 days ago
2009
Springer
85
Voted
STOC
2002
ACM
16 years 29 days ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
112
Voted
FUZZIEEE
2007
IEEE
15 years 7 months ago
2007
IEEE
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
110
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
107
Voted
AI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...