96 search results - page 13 / 20 » Length-bounded cuts and flows |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Variational problems, which are commonly used to solve lowlevel vision tasks, are typically minimized via a local, iterative optimization strategy, e.g. gradient descent....
FPGA
2001
ACM
13 years 12 months ago
2001
ACM
Conventional technology mapping algorithms for SRAM-based Field Programmable Gate Arrays (FPGAs) are normally carried out on a fixed logic decomposition of a circuit. The impact o...
DAM
2008
13 years 7 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...