1963 search results - page 157 / 393 » The Maximum Solution Problem on Graphs |
NETWORKS
2006
15 years 2 months ago
2006
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
121
click to vote
DAC
2003
ACM
16 years 3 months ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
120
click to vote
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
145
Voted
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
123
Voted
DAGM
2008
Springer
15 years 4 months ago
2008
Springer
We introduce the OneClassMaxMinOver (OMMO) algorithm for the problem of one-class support vector classification. The algorithm is extremely simple and therefore a convenient choice...