80 search results - page 1 / 16 » A fast cost scaling algorithm for submodular flow |
53
Voted
IPL
2000
14 years 9 months ago
2000
MP
2002
14 years 9 months ago
2002
ALGORITHMICA
2010
14 years 10 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
83
Voted
SIGGRAPH
2010
ACM
15 years 2 months ago
2010
ACM
Large scale fluid simulation can be difficult using existing techniques due to the high computational cost of using large grids. We present a novel technique for simulating deta...
FMCAD
2007
Springer
15 years 4 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...