20 search results - page 3 / 4 » Bipartite subgraphs of integer weighted graphs |
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
HICSS
2008
IEEE
14 years 1 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
EMMCVPR
2005
Springer
14 years 27 days ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
SIROCCO
1997
13 years 8 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...