362 search results - page 58 / 73 » A Branch-and-Cut algorithm for graph coloring |
VLSISP
2002
13 years 7 months ago
2002
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
PPSN
1992
Springer
13 years 12 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
ICASSP
2007
IEEE
14 years 2 months ago
2007
IEEE
Recently graph-cut optimization has been extensively explored for interactive image segmentation. In this paper we propose Discriminative Gaussian Mixtures (DGMs) to boost the per...
ALGORITHMICA
2008
13 years 8 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
WINET
2010
13 years 6 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...