Sciweavers

1404 search results - page 98 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ISBI
2009
IEEE
15 years 4 months ago
Structural Annotation of EM Images by Graph Cut
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
Hang Chang, Manfred Auer, Bahram Parvin
APPROX
2005
Springer
104views Algorithms» more  APPROX 2005»
15 years 3 months ago
On the Error Parameter of Dispersers
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in so...
Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon ...
CVPR
2008
IEEE
16 years 1 days ago
FusionFlow: Discrete-continuous optimization for optical flow estimation
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
Victor S. Lempitsky, Stefan Roth, Carsten Rother
CORR
2006
Springer
146views Education» more  CORR 2006»
14 years 10 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
GECCO
2003
Springer
15 years 3 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene