96 search results - page 3 / 20 » Length-bounded cuts and flows |
72
Voted
FPGA
1995
ACM
15 years 3 months ago
1995
ACM
In this paper, we present an improvement of the FlowMap algorithm, named CutMap, which combines depth and area minimization in the mapping process by computing min-cost min-height...
89
Voted
INFORMS
2010
14 years 10 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
PDPTA
2004
15 years 1 months ago
2004
Cluster networks will serve as the future access networks for multimedia streaming, massive multiplayer online gaming, e-commerce, network storage etc. And for those application ar...
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...