961 search results - page 66 / 193 » Significance-Driven Graph Clustering |
148
click to vote
HIS
2009
15 years 1 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
149
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...
117
Voted
TVCG
2008
15 years 4 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...
161
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...
118
click to vote
ISCAPDCS
2007
15 years 5 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...