16 search results - page 2 / 4 » Crossing Minimization in Weighted Bipartite Graphs |
ISCAS
1999
IEEE
13 years 9 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
INFORMS
2010
13 years 2 months ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper, we present a novel approach to recognizing human actions from different views by view knowledge transfer. An action is originally modelled as a bag of visual-words ...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...