107 search results - page 9 / 22 » Factor cuts |
60
Voted
ECAI
1998
Springer
15 years 1 months ago
1998
Springer
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
SODA
1997
ACM
14 years 11 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
59
Voted
NIPS
2003
14 years 11 months ago
2003
We propose an information-theoretic clustering approach that incorporates a pre-known partition of the data, aiming to identify common clusters that cut across the given partition...
BMCBI
2008
14 years 9 months ago
2008
Background: Formal classification of a large collection of protein structures aids the understanding of evolutionary relationships among them. Classifications involving manual ste...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...