840 search results - page 99 / 168 » Inapproximability of Combinatorial Optimization Problems |
ICIP
2010
IEEE
14 years 10 months ago
2010
IEEE
Quantization, defined as the act of attributing a finite number of grey-levels to an image, is an essential task in image acquisition and coding. It is also intricately linked to ...
107
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
99
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
181
Voted
IJCV
2006
15 years 12 days ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
This research uses a Design of Experiments (DOE) approach to build a predictive model of the performance of a combinatorial optimization heuristic over a range of heuristic tuning...