843 search results - page 36 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
IJKESDP
2010
13 years 5 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
MICCAI
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. In this paper, we propose a new feature based non-rigid image registration method for dealing with two important issues. First, in order to establish reliable anatomical ...
ICML
1996
IEEE
14 years 8 months ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
MP
1998
13 years 7 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...