181 search results - page 4 / 37 » Fast Approximate Graph Partitioning Algorithms |
DAM
2008
13 years 5 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
UAI
2004
13 years 6 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
ICCV
2003
IEEE
14 years 7 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...