101 search results - page 5 / 21 » Graph Partition by Swendsen-Wang Cuts |
100
Voted
PAMI
2010
15 years 7 days ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
157
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
132
Voted
IM
2007
15 years 1 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
125
click to vote
UAI
2004
15 years 3 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...
103
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...