4759 search results - page 316 / 952 » Parallelizing the Phylogeny Problem |
173
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
217
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Existing privacy-preserving evolutionary algorithms are limited to specific problems securing only cost function evaluation. This lack of functionality and security prevents thei...
173
click to vote
EMNLP
2009
15 years 4 months ago
2009
Untranslated words still constitute a major problem for Statistical Machine Translation (SMT), and current SMT systems are limited by the quantity of parallel training texts. Augm...
170
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
218
click to vote
CONCUR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...