1984 search results - page 7 / 397 » The colourful feasibility problem |
ICIP
2009
IEEE
13 years 7 months ago
2009
IEEE
Natural image matting is an extremely challenging image processing problem due to its ill-posed nature. It often requires skilled user interaction to aid definition of foreground ...
MP
1998
13 years 9 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
DISOPT
2007
13 years 9 months ago
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
TIT
2011
13 years 4 months ago
2011
Signal-to-noise (SNR) ratio is commonly regarded as a reliable measure of the performance of wireless communication systems. Knowledge of the fundamental properties of the feasibl...
MP
2002
13 years 9 months ago
2002
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...