Sciweavers

5331 search results - page 169 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ECCV
2002
Springer
15 years 12 months ago
Maximizing Rigidity: Optimal Matching under Scaled-Orthography
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
João Costeira, João Maciel
89
Voted
GECCO
2003
Springer
15 years 3 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
110
Voted
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
14 years 29 days ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
95
Voted
COMPGEOM
2005
ACM
15 years 2 days ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner
SAGA
2009
Springer
15 years 4 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel