1951 search results - page 125 / 391 » An algorithm for improving graph partitions |
132
click to vote
CVPR
2000
IEEE
15 years 9 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
170
click to vote
SWAT
2010
Springer
15 years 9 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
145
click to vote
ALT
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
149
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
132
click to vote
GBRPR
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...