1538 search results - page 113 / 308 » Spectral Techniques in Graph Algorithms |
117
click to vote
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...
148
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
171
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, a novel hierarchical clustering method using link analysis techniques is introduced. The algorithm is formulated as an authority seeking procedure on graphs, which c...
AAIM
2008
Springer
15 years 7 months ago
2008
Springer
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...
COCO
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...