4009 search results - page 118 / 802 » Clustering on Complex Graphs |
170
click to vote
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
128
Voted
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
144
click to vote
UAI
2004
15 years 5 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...
110
Voted
TVCG
2008
15 years 3 months ago
2008
Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorit...
158
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...