1115 search results - page 98 / 223 » Active Graph Cuts |
131
Voted
AMAI
2004
Springer
15 years 7 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
109
Voted
PLDI
2000
ACM
15 years 6 months ago
2000
ACM
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
106
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
176
Voted
ECCV
2008
Springer
16 years 21 days ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
140
click to vote
ENTCS
2006
15 years 2 months ago
2006
A taxonomy of model transformations was introduced in [18]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best sui...