273 search results - page 24 / 55 » Can Pure Cutting Plane Algorithms Work |
FSTTCS
2004
Springer
14 years 28 days 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...
SCVMA
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. In this paper we present a generative model for image sequences, which can be applied to motion segmentation and tracking, and to image sequence compression. The model co...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
ESOP
2010
Springer
14 years 4 months ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...