Sciweavers

883 search results - page 86 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
PAMI
2006
180views more  PAMI 2006»
13 years 7 months ago
Globally Minimal Surfaces by Continuous Maximal Flows
In this paper we consider the problem of computing globally minimal continuous curves and surfaces for image segmentation and 3D reconstruction. This is solved using a maximal flo...
Ben Appleton, Hugues Talbot
DICTA
2003
13 years 9 months ago
Globally Optimal Surfaces by Continuous Maximal Flows
Abstract. In this paper we solve the problem of computing exact continuous optimal curves and surfaces for image segmentation and 3D reconstruction, using a maximal flow approach ...
Ben Appleton, Hugues Talbot
ALGORITHMICA
2011
13 years 2 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
ICDAR
2011
IEEE
12 years 7 months ago
Objective Function Design for MCE-Based Combination of On-line and Off-line Character Recognizers for On-line Handwritten Japane
—This paper describes effective object function design for combining on-line and off-line character recognizers for on-line handwritten Japanese text recognition. We combine on-l...
Bilan Zhu, Jinfeng Gao, Masaki Nakagawa
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye