604 search results - page 24 / 121 » On the Complexity of the Maximum Cut Problem |
DCG
2008
13 years 8 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
TNN
2008
13 years 8 months ago
2008
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
ISBI
2009
IEEE
14 years 3 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...