2714 search results - page 175 / 543 » Approximation Schemes for Scheduling |
142
Voted
ISBI
2004
IEEE
16 years 1 months ago
2004
IEEE
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
122
Voted
SARA
2009
Springer
15 years 7 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
FPL
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper presents a new scheme for the hardware evaluation of elementary functions, based on a piecewise second order minimax approximation. The novelty is that this ev...
131
Voted
CSC
2009
15 years 2 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
104
Voted
CGF
2004
15 years 29 days ago
2004
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...