62 search results - page 3 / 13 » Branch Cuts in Computer Algebra |
CVPR
2005
IEEE
15 years 26 days ago
2005
IEEE
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
COR
2007
13 years 11 months ago
2007
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
COCO
1993
Springer
14 years 3 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
ASPDAC
2006
ACM
14 years 4 months ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
ECCV
2008
Springer
15 years 23 days ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...