604 search results - page 15 / 121 » On the Complexity of the Maximum Cut Problem |
ESANN
2006
13 years 9 months ago
2006
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
IMSCCS
2007
IEEE
14 years 1 months ago
2007
IEEE
TOPSAW program was developed by Dr. S. Chang and his team and has been successfully used in the replication of sawmill cutting to determine the optimal cutting pattern for a log t...
EMMCVPR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Feature selection plays a fundamental role in many pattern
recognition problems. However, most efforts have been
focused on the supervised scenario, while unsupervised feature
s...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...