1749 search results - page 172 / 350 » Conditional colorings of graphs |
183
click to vote
ICDM
2007
IEEE
16 years 29 days ago
2007
IEEE
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
204
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a new approach to the analysis of Loopy Belief Propagation (LBP) by establishing a formula that connects the Hessian of the Bethe free energy with the edge zeta functio...
149
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...
153
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
165
click to vote
JCT
2006
15 years 6 months ago
2006
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...