843 search results - page 106 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
136
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
176
click to vote
TCS
2010
15 years 3 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
158
Voted
EMO
2003
Springer
15 years 10 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
139
click to vote
JGO
2010
15 years 3 months ago
2010
Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning l...
170
Voted
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...