431 search results - page 33 / 87 » Implementing the maximum of monotone algorithms |
KI
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes a new method for automatic estimation of the contours of the femur and of the cranial cross-section in fetal ultrasound images. Our approach can be described ...
SOCIALCOM
2010
14 years 7 months ago
2010
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
14 years 10 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...