206 search results - page 40 / 42 » Ant colony optimization and the minimum cut problem |
CAGD
2002
14 years 9 months ago
2002
Many applications, such as contour machining, rapid prototyping, and reverse engineering by laser scanner or coordinate measuring machine, involve sampling of free-from surfaces a...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
122
click to vote
MVA
2008
14 years 9 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
110
click to vote
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...