40 search results - page 6 / 8 » Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs |
99
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
133
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
173
Voted
JMLR
2010
14 years 10 months 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...
118
Voted
CVPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
152
Voted
ICPP
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...