136 search results - page 2 / 28 » Experimental Study of Minimum Cut Algorithms |
JGAA
2000
14 years 9 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
118
click to vote
ECCV
2008
Springer
15 years 8 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
69
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
A new model for the One-dimensional Cutting Stock problem using Genetic Algorithms (GA) is developed to optimize construction steel bars waste. One-dimensional construction stocks...
80
Voted
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper provides that an elastic force and an elastic potential energy due to the deformation of soft fingers, which are previously derived, can be calculated into straight...