843 search results - page 34 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
SODA
1997
ACM
13 years 8 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
ICDCIT
2012
Springer
12 years 3 months ago
2012
Springer
Abstract. A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall sy...
TEC
2010
13 years 2 months ago
2010
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
Binary segmentation, a problem of extracting foreground objects from the background, often arises in medical imaging and document processing. Popular existing solutions include Ex...
JC
2006
13 years 7 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...