Sciweavers

1404 search results - page 201 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ECCC
2006
88views more  ECCC 2006»
14 years 9 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
16 years 2 months ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
ICCV
2005
IEEE
15 years 3 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov
EMMCVPR
2009
Springer
15 years 4 months ago
Multi-label Moves for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
Olga Veksler
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
Sketching Clothoid Splines Using Shortest Paths
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...
Ilya Baran, Jaakko Lehtinen, Jovan Popovic