77 search results - page 12 / 16 » Large cycles in 4-connected graphs |
JMLR
2006
13 years 7 months ago
2006
We present a new framework based on walks in a graph for analysis and inference in Gaussian graphical models. The key idea is to decompose the correlation between each pair of var...
TON
2010
13 years 5 months ago
2010
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
CPC
2002
13 years 7 months ago
2002
Co-learning is a model involving agents from a large population, who interact by playing a fixed game and update their behaviour based on previous experience and the outcome of th...
KDD
2012
ACM
11 years 9 months ago
2012
ACM
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
WADS
2001
Springer
13 years 11 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...