136 search results - page 8 / 28 » Experimental Study of Minimum Cut Algorithms |
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
GD
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
EMMCVPR
1999
Springer
15 years 1 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
ICCAD
1993
IEEE
15 years 1 months ago
1993
IEEE
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...