144 search results - page 3 / 29 » Quality of LP-Based Approximations for Highly Combinatorial ... |
ECCV
2010
Springer
13 years 7 months ago
2010
Springer
Although the recent advances in the sparse representations of images have achieved outstanding denosing results, removing real, structured noise in digital videos remains a challen...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
COR
2006
13 years 6 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
HIS
2008
13 years 7 months ago
2008
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...
ICCS
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...