407 search results - page 15 / 82 » Optimization of Linear Logic Programs Using Counting Methods |
ISBI
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we propose a novel method to recover the 3D shape of the knee and of the prosthesis for the patients that have undergone total knee replacement surgery. We address t...
TCBB
2008
13 years 7 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
IPCO
2008
13 years 9 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...