Sciweavers

407 search results - page 47 / 82
» The Optimal Online Algorithms for Minimizing Maximum Latenes...
Sort
View
JMIV
2007
145views more  JMIV 2007»
14 years 11 months ago
Level Lines Selection with Variational Models for Segmentation and Encoding
Abstract. This paper discusses the interest of the Tree of Shapes of an image as a region oriented image representation. The Tree of Shapes offers a compact and structured represen...
Coloma Ballester, Vicent Caselles, Laura Igual, Ll...
IPPS
1998
IEEE
15 years 4 months ago
Deterministic Routing of h-relations on the Multibutterfly
In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N-input/output multibutterfly. The algorithm, which is obtained by generalizing th...
Andrea Pietracaprina
CVIU
2008
180views more  CVIU 2008»
14 years 12 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
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...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
NIPS
2007
15 years 1 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
FUIN
2008
80views more  FUIN 2008»
14 years 12 months ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...