3068 search results - page 112 / 614 » Clustering with Multiple Graphs |
175
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...
165
click to vote
JMLR
2011
15 years 1 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
301
click to vote
MICCAI
2009
Springer
15 years 8 months ago
2009
Springer
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
160
click to vote
ACSC
2003
IEEE
15 years 11 months ago
2003
IEEE
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...
184
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...