3068 search results - page 64 / 614 » Clustering with Multiple Graphs |
SIGIR
2000
ACM
15 years 4 months ago
2000
ACM
We investigate four hierarchical clustering methods (single-link, complete-link, groupwise-average, and single-pass) and two linguistically motivated text features (noun phrase he...
112
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
109
click to vote
TVCG
2011
14 years 7 months ago
2011
—In this paper, we present the results of a human computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small mu...
95
Voted
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
125
click to vote
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...