4112 search results - page 81 / 823 » Efficient Algorithms for the Spoonerism Problem |
136
click to vote
JCST
2008
15 years 4 months ago
2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
129
click to vote
NETWORKS
2008
15 years 4 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
130
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
111
click to vote
JMLR
2006
15 years 4 months ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
124
Voted
ICCAD
1996
IEEE
15 years 8 months ago
1996
IEEE
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...