1327 search results - page 156 / 266 » Path following algorithm for the graph matching problem |
146
Voted
WADS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
127
click to vote
AAAI
1990
15 years 5 months ago
1990
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
144
click to vote
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
147
click to vote
AAAI
2008
15 years 6 months ago
2008
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
144
click to vote
PAMI
2007
15 years 3 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...