843 search results - page 53 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
120
click to vote
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
131
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
106
click to vote
SIGMOD
1999
ACM
15 years 5 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
106
click to vote
JCO
2011
14 years 8 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
105
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
—This paper deals with optimized training sequences to estimate multiple-input multiple-output orthogonal frequencydivision multiplexing (MIMO-OFDM) channel states in the presenc...