604 search results - page 29 / 121 » On the Complexity of the Maximum Cut Problem |
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
CVPR
2008
IEEE
2008
IEEE
Discovering class specific composite features through discriminative sampling with Swendsen-Wang Cut
16 years 1 months ago
This paper proposes a novel approach to discover a set of class specific "composite features" as the feature pool for the detection and classification of complex objects...
162
click to vote
TCAD
2010
14 years 6 months ago
2010
As contemporary VLSI designs grow in complexity, design debugging has rapidly established itself as one of the largest bottlenecks in the design cycle today. Automated debug soluti...
117
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
117
click to vote
EC
2008
14 years 11 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...