448 search results - page 39 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
CODES
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
PDPTA
2010
13 years 5 months ago
2010
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
NCA
2007
IEEE
14 years 1 months ago
2007
IEEE
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
CVIU
2010
13 years 7 months ago
2010
We address the problem of variational optical flow for video processing applications that need fast operation and robustness to drastic variations in illumination. Recently, a sol...