7 search results - page 1 / 2 » Preserving Patterns in Bipartite Graph Partitioning |
ICTAI
2006
IEEE
13 years 10 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 ...
SDM
2007
SIAM
13 years 6 months ago
2007
SIAM
CVPR
2012
IEEE
11 years 7 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...
ICALP
2010
Springer
13 years 9 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...
DAM
2010
13 years 4 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...