7 search results - page 1 / 2 » Preserving Patterns in Bipartite Graph Partitioning |
95
Voted
ICTAI
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
56
Voted
SDM
2007
SIAM
15 years 9 days ago
2007
SIAM
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
83
Voted
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
93
Voted
DAM
2010
14 years 11 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...