43 search results - page 8 / 9 » Designing fast converging phylogenetic methods |
ICIP
1998
IEEE
14 years 7 months ago
1998
IEEE
We present a novel formulation for B-spline snakes that can be used as a tool for fast and intuitive contour outlining. The theory is implemented in a platform independent JAVA in...
ICML
2009
IEEE
14 years 6 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
GECCO
2007
Springer
14 years 6 days ago
2007
Springer
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
NIPS
2007
13 years 7 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
This paper introduces a new approach to develop a fast gait for quadruped robot using genetic programming (GP). Several recent approaches have focused on the genetic algorithm (GA...