604 search results - page 23 / 121 » On the Complexity of the Maximum Cut Problem |
CG
1998
Springer
14 years 1 months ago
1998
Springer
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
CPM
2000
Springer
14 years 1 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we present a new framework of video object
segmentation, in which we formulate the task of extracting
prominent objects from a scene as the problem of hypergraph
...
MP
2010
13 years 3 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...